PAT ranking

输入描述
Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

输出描述
For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:
registration_number final_rank location_number local_rank
The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

输入例子：
2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85
输出例子
9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
struct student{
    char id[14];
    int room;
    int score;
    int lrank;
}stu[30010];
using namespace std;
bool cmp(student a,student b)
{
    if (a.score>b.score) return true;
    else if(a.score<b.score) return false;
    else return strcmp(a.id,b.id)<0;
}
int main(){
    int n,m,num=0;
    cin>>n;
    for(int i = 1;i<=n;i++)
    {
        cin>>m;
        for(int j=0;j<m;j++)
        {
            cin>>stu[num].id>>stu[num].score;
            stu[num].room = i;
            num++;

        }
        sort(stu+num-m,stu+num,cmp);
        stu[num-m].lrank = 1;
        for(int j = num - m +1;j<num;j++)
        {
            if(stu[j].score == stu[j-1].score)
                stu[j].lrank=stu[j-1].lrank;
            else
                stu[j].lrank=j+1-(num-m);
        }

    }
    cout<<num<<endl;
    sort(stu,stu+num,cmp);
    int r = 1;
    for(int i=0;i<num;i++)
    {
        if(i>0&&stu[i].score!= stu[i-1].score)
            r=i+1;
        cout<<stu[i].id<<" ";
        cout<<r<<" "<<stu[i].room<<" "<<stu[i].lrank<<endl;
    }
    return 0;
}