Contents

1. 1. Input Specification:
2. 2. Output Specification:
3. 3. Sample Input:
4. 4. Sample Output:

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 Nranklists 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组数据，每一组数据中有m个考生信息（信息分编号和成绩两部分）。按考生成绩非增序（成绩一样按编号升序）打印学生编号、总排名、组内排名和组号。

分析：定义结构体node，每一个node代表一个学生，其中包括编号、成绩、组内排名、总排名、组号。在每一组输入完成后，对改组内的成员排序并给出其组号和组内排名，然后将其保存动态数组v中。对v进行排序后可以得到每一个学生的总排名，按顺序打印即可。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct node{
    string id;
    int score,final_rank,location_number,local_rank;
};
bool cmp(node a,node b){
    return a.score != b.score ? a.score > b.score : a.id < b.id;
}
int main(){
    int n,m;
    vector<node> v;
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> m;
        vector<node> temp(m);
        for(int j=0;j<m;j++){
            cin >> temp[j].id >> temp[j].score;
            temp[j].location_number = i;
        }
        sort(temp.begin(),temp.end(),cmp);
        temp[0].local_rank = 1;
        for(int j=1;j<temp.size();j++){
            if (temp[j].score == temp[j-1].score) temp[j].local_rank = temp[j-1].local_rank;
            else temp[j].local_rank = j+1;
        }
        for(int j=0;j<m;j++)
            v.push_back(temp[j]);
    }
    sort(v.begin(),v.end(),cmp);
    v[0].final_rank = 1;
    for(int i=1;i<v.size();i++){
        if (v[i].score == v[i-1].score) v[i].final_rank = v[i-1].final_rank;
        else v[i].final_rank = i+1;
    }
    cout << v.size() << endl;
    for(int i=0;i<v.size();i++)
        cout << v[i].id << " " << v[i].final_rank << " " << v[i].location_number << " " << v[i].local_rank << endl;
    return 0;
}