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
这题的思路很清晰,也就是先输入一个组,然后按照这个组的分数以及学号,按照定义的cmp进行sort排序,然后计算每个考场内的排名,依次计算所需的若干组,最后再将他们全部按照cmp进行排序,在计算他们的总体排名。
具体的代码如下:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct Student
{
char number[15];//学号
int l_rank;//考场内排名
int l_number;//考场号
int score;
}stu[30010];
bool cmp(Student a, Student b)
{
if (a.score != b.score)
return a.score > b.score;
else
return strcmp(a.number,b.number)<0;//否则将姓名字典序小的排在前面
}
int main()
{
int n, k;//n为有几组,m为每组样例数
int i, m = 0, j = 0, num = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
scanf("%d", &k);
for (j = m; j < k+m; j++)//j=m,防止后面的组被替换
{
scanf("%s%d", stu[j].number, &stu[j].score);
stu[num].l_number = i;
num++;
}
sort(stu + num - k, stu + num, cmp);
stu[num - k].l_rank = 1;
for (j = num - k + 1; j < num; j++)
{
if (stu[j].score == stu[j - 1].score)
stu[j].l_rank = stu[j - 1].l_rank;
else
stu[j].l_rank = j + 1 - (num - k);
}
m = j;
}
printf("%d\n", num);
sort(stu, stu + num, cmp);
int r = 1;
for (i = 0; i < num; i++)
{
if (i>0&&stu[i].score != stu[i - 1].score)
r = i + 1;
printf("%s ", stu[i].number);
printf("%d %d %d\n", r, stu[i].l_number, stu[i].l_rank);
}
return 0;
}