ZJU PAT 1025 PAT Ranking

http://pat.zju.edu.cn/contests/pat-practise/1025

超级无聊的模拟题。

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int N;
int K;
struct Student{
    char name[14];
    int score;
    int loc_number;
    int loc_rank;
}stu[30000];
bool cmp(struct Student a,struct Student b)
{
    if(a.score!=b.score){
        return a.score>b.score;
    }
    return strcmp(a.name,b.name)<0;
}

int main()
{
    scanf("%d",&N);
    int i,k=-1;
    int sum=0;
    for(i=0;i<N;i++){
        scanf("%d",&K);
        sum+=K;
        int j;
        for(j=0;j<K;j++){
            scanf("%s%d",&stu[k+1].name,&stu[k+1].score);
            stu[1+k].loc_number=i+1;
            k++;
        }

        sort(stu+1+k-K,stu+k+1,cmp);
        stu[k-K+1].loc_rank=1;
        int pre=1;
        int d=1;
        for(j=k-K+2;j<=k;j++){
            if(stu[j].score==stu[j-1].score){
                stu[j].loc_rank=pre;
                d++;
            }
            else    {
                stu[j].loc_rank=pre+d;
                pre+=d;
                d=1;
            }
        }
    }
    sort(stu,stu+k+1,cmp);

    i=0;
    printf("%d\n",sum);
    printf("%s %d %d %d\n",stu[i].name,1,stu[i].loc_number,stu[i].loc_rank);
    int d=1;
    int pre=1;
    for(i=1;i<=k;i++){
        if(stu[i].score==stu[i-1].score){
            printf("%s %d %d %d\n",stu[i].name,pre,stu[i].loc_number,stu[i].loc_rank);
            d++;
        }else{
            printf("%s %d %d %d\n",stu[i].name,pre+d,stu[i].loc_number,stu[i].loc_rank);
            pre+=d;
            d=1;
        }
    }
}