PAT A1025 Ranking (25 分)

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:
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.

Output Specification:
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.

Sample Input:
2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85
Sample Output:
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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct Student{
    char id[30];//准考证号
    int score;//分数
    int location_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].location_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);
    int r=1;
    for(int i=0;i<num;i++){
        if(i>0&&stu[i].score!=stu[i-1].score){
            r=i+1;
        }
        printf("%s ",stu[i].id);
        printf("%d %d %d\n",r,stu[i].location_number,stu[i].local_rank);
    }
    return 0;
}

重点：采用sort方法排序，重写cmp函数（cstring），添加字典序排序方法，即strcmp(a.id,b.id)<0，这样的写法与a.id<b.id在意义上是相同的，只在格式上不同。