HDU 2115
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct jg{
char name[100];
int time;
int num;
} d[12];
int cmp(jg x,jg y)
{ return (x.time==y.time? strcmp(x.name,y.name)>1:x.time<y.time);
}
int main()
{int n,i,k=1;
while (scanf("%d",&n)!=EOF,n)
{ int p,q;
for(i=0;i<n;i++)
{ scanf("%s %d:%d", d[i].name,&p,&q);
d[i].time=p*60+q;
}
sort(d,d+n,cmp);
if(k!=1) printf("\n");
printf("Case #%d\n",k++);
for(i=0;i<n;i++)
{ if(i>0&&d[i].time==d[i-1].time)
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;
}