PAT A1025，PAT Ranking (25)

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

struct Student
{
    char id[20];
    int score;
    int final_rank;
    int local_number;
    int local_rank; 
}stu[30010];

bool cmp(Student a, Student b)
{
    if(a.score != b.score)
        return a.score > b.score;
    else
        return strcmp(a.id, b.id) < 0;
}

int main()
{
    int n, k, num = 0;

    // 录入每个考场的考生信息 
    scanf("%d",&n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d",&k);
        for(int j = 0; j < k; j++)
        {
            scanf("%s %d",stu[num].id,&stu[num].score);
            stu[num].local_number = i;
            num++;
        }
        // 对每个考场的考生成绩，进行排名 
        sort(stu+num-k, stu+num, cmp);
        stu[num-k].local_rank = 1;
        for(int j = num-k+1; j < num; j++)
        {
            if(stu[j].score == stu[j-1].score)
                stu[j].local_rank = stu[j-1].local_rank;
            else
                stu[j].local_rank = j + 1 - (num-k);
        }
    }
    // 对全体考生成绩，进行排名并输出 
    printf("%d\n",num);
    sort(stu, stu+num, cmp);
    stu[0].final_rank = 1;
    for(int i = 0; i < num; i++)
    {
        if(i != 0 && stu[i].score == stu[i-1].score)
            stu[i].final_rank = stu[i-1].final_rank;
        else
            stu[i].final_rank = i+1; 
        printf("%s ",stu[i].id);
        printf("%d %d %d\n",stu[i].final_rank,stu[i].local_number,stu[i].local_rank);
    }

    return 0;
}