hdu 2115（I Love This Game）

Webpage link address  http://acm.hdu.edu.cn/showproblem.php?pid=2115

I personally think this is good problem for training string processing.And i learned much from the problem by solving this problem;

well,the idea of the problem is clear,so i just say someting we should pay attentioned to;

First,if you want to use the ranking function "sort" ,you must add a header file "#include<algorithm>";

Second,output the same players in lexicographic order,you can use the function "strcmp()",it's very useful.

Third ,you must notice the format of the output.      I am a noob.

Code view:

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct node
{
    char name[30];
    int time;
    int rank;
}player[12];
int cmp(node a,node b)
{
    if(a.time==b.time)
        return strcmp(a.name,b.name)<0;
    else
        return a.time<b.time;
}
int main()
{
    int n;
    int num=0;
    int min,sec;
    while(cin>>n)
    {
        if(!n) break;
        getchar();
         num++;
        if(num!=1)  printf("\n");
  printf("Case #%d\n",num);
       
        for(int i=0;i<n;i++)
        {
            scanf("%s %d:%d",player[i].name,&min,&sec);
            player[i].time=60*min+sec;
        }
        sort(player,player+n,cmp);
        player[0].rank=1;
        for(int j=0;j<n;j++)
        {
            if(player[j].time==player[j-1].time)
                player[j].rank=player[j-1].rank;
            else
                player[j].rank=j+1;
        }
       
        for(int k=0;k<n;k++)
        {
            printf("%s %d\n",player[k].name,player[k].rank);
        }
       
    }
    return 0;
}

 Thank you for visiting me!