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
//结尾无空行
AC程序
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
struct Student {
char id[15];
int score;
int location_num; //考场号
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,i,k,num=0;
scanf("%d", &n);
for (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_num = i;//该考生的考场号为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 (i = 0; i < num; i++) {
if (i > 0 && stu[i].score !=stu[i - 1].score) {
r = i + 1;
}
printf("%s %d %d %d\n", stu[i].id, r, stu[i].location_num, stu[i].local_rank);
}
return 0;
}