一、题目
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
二、题目大意
不同考场的学生,求解每个人在考场的排名和总排名。
三、考点
排序
四、注意
1、自定义struct排名;
2、成绩相等,排名相等;
3、先对考场排名,之后全部排名。
五、代码
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
struct node {
string num;
int grade;
int loc;
int frank;
int lrank;
};
bool cmp(node n1, node n2) {
if (n1.grade != n2.grade)
return n1.grade > n2.grade;
else
return n1.num < n2.num;
}
int main() {
//read
int n;
cin >> n;
vector<vector<node>> vec(n + 1);
vector<node> vec_all;
int num = 0;
for (int i = 1; i <= n; ++i) {
int m;
cin >> m;
num += m;
for (int j = 0; j < m; ++j) {
node tmp;
cin >> tmp.num >> tmp.grade;
tmp.loc = i;
vec[i].push_back(tmp);
}
//sort
sort(vec[i].begin(), vec[i].end(), cmp);
//local rank
for (int j = 0; j < m; ++j) {
if (j == 0)
vec[i][j].lrank = 1;
else {
if (vec[i][j].grade == vec[i][j - 1].grade)
vec[i][j].lrank = vec[i][j - 1].lrank;
else
vec[i][j].lrank = j + 1;
}
vec_all.push_back(vec[i][j]);
}
}
//sort all
sort(vec_all.begin(), vec_all.end(), cmp);
//all rank
int rank = 1;
for (int j = 0; j < num; ++j) {
if (j == 0)
vec_all[j].frank = 1;
else {
if (vec_all[j].grade == vec_all[j - 1].grade)
vec_all[j].frank = vec_all[j - 1].frank;
else
vec_all[j].frank = j + 1;
}
}
//output
cout << num << endl;
for (int i = 0; i < num; ++i) {
cout << vec_all[i].num << " " << vec_all[i].frank << " " << vec_all[i].loc << " " << vec_all[i].lrank << endl;
}
system("pause");
return 0;
}