结构体 HDU 2115

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct a
{ 
 char name[100]; 
 int m,s; 
 int tim; 
 int num;
}d[11];
int cmp(a x,a y)
{ 
return (x.tim==y.tim? strcmp(x.name,y.name)>1:x.tim<y.tim);
}
int main()
{   
//freopen("1.txt","r",stdin); 
int n,i,k=1; 
while(scanf("%d%*c",&n)!=EOF&&n!=0)
 {  
  for(i=0;i<n;i++)  
  {
   scanf("%s %d:%d",d[i].name,&d[i].m,&d[i].s);   
   d[i].tim=d[i].m*60+d[i].s;  
  }  
   sort(d,d+n,cmp);  
   if(k!=1)printf("\n");  
   printf("Case #%d\n",k++);
   for(i=0;i<n;i++)
   {
    if(i>=1&&d[i].tim==d[i-1].tim)
    {d[i].num=d[i-1].num;}
   else
    {d[i].num=i+1;}
    printf("%s %d\n",d[i].name,d[i].num);
   }
  }
return 0;
}