PAT(甲级)1025 PAT 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

简单的说，就是一个排序的问题，先是输入一个n，可以看作是不同的房间，每个房间有k个人考试，对这个k个人进行排序，然后对所有人进行排序，以所有人排序优先输出每个人的id，全部人名词，房间号，以及各房间里面的名词。

主要做法还是利用sort函数，可以将每个人的数据放入struct里面，然后用其组成的数组进行排序，分数一样，还得按照字符串的大小进行比较，但是单纯的字符串不好比较，化成整形又太麻烦，所以用char数组存储，然后用strcmp来比较就比较方便了（算法笔记上面的是这个做法0_0）

strcmp可以比较两个字符串的大小，小的话就返回负数，等于就返回0，大于返回正数，也是比较好用的。

主要最后是以全体排序为主，所以全体排序可以放在最后，然后每个房间里面的人排序的信息可以先放入struct里面，最后再顺序出来后，再把struct里面的信息输出出来。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct student{
    char id[15];
    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;
    cin >> n;
    for (int i = 1; i <= n;i++)
    {
        cin >> k;
        for (int j = 0; j < k;j++)
        {
            cin >> 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);
        }
    }
    cout<<num<<'\n';
    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);
        cout << r << ' ' << stu[i].location_number << ' ' << stu[i].local_rank << '\n';
        
    }

    return 0;
}