1025 PAT Ranking (25 分)

注意cmp的使用

bool cmp(a x,a y){
   if(x.score!=y.score) return x.score>y.score;
   else return strcmp(x.info,y.info)<0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct a{
    char info[20];
    int score;
    int final_rank;
    int location;
    int local_rank;
}stu[30000];
bool cmp(a x,a y){
   if(x.score!=y.score) return x.score>y.score;
   else return strcmp(x.info,y.info)<0;
}


int main()
{
    int n,k,s=0,t=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&k);
        for(int j=0;j<k;j++){
            stu[s].location =i+1;
            scanf("%s %d",stu[s].info,&stu[s].score);
            s++;
        }
        sort(stu+t,stu+s,cmp);
        stu[t].local_rank =1;
        for(int z =t+1;z<s;z++){
            if(stu[z].score == stu[z-1].score)stu[z].local_rank =stu[z-1].local_rank;
            else stu[z].local_rank = z+1-t;
        }
        t =s;
    }
    printf("%d\n",s);
    sort(stu,stu+s,cmp);
    stu[0].final_rank =1;
    for(int i =1;i<s;i++){
        if(stu[i].score == stu[i-1].score){stu[i].final_rank =stu[i-1].final_rank;}
        else {
            stu[i].final_rank = i+1;

        }
    }
    for(int i =0;i<s;i++){
        printf("%s %d %d %d\n",stu[i].info,stu[i].final_rank,stu[i].location,stu[i].local_rank);
    }
    return 0;
}