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个例子，每个例子由编号及其分数组成，最后求其组内的序号及在所有数据中的排名final_rank。
解题思路：利用struct，sort来求解即可，排序时，如果分数相同，就需要由编号从小到大排。
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<vector>
using namespace std;
#include<algorithm>
struct Test{
char id[15];
int score;
int final_rank;
int location_number;
int local_rank;
};
Test test[30005];
bool cmp(Test t1,Test t2){
if(t1.score>t2.score || (t1.score == t2.score && strcmp(t1.id,t2.id)<0)){
return 1;
}
else{
return 0;
}
}
int main(){
int n,k;
int i,j;
int k_old=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&k);
for(j=k_old;j<k+k_old;j++){
scanf("%s%d",test[j].id,&test[j].score);
test[j].location_number=i+1;
}
sort(test+k_old,test+k_old+k,cmp);
int rank = 1;
int score = test[k_old].score;
test[k_old].local_rank=rank;
int m=1;
for(int t = k_old+1;t<k+k_old;t++){
if(test[t].score!=score){
score=test[t].score;
test[t].local_rank=rank+m;
rank+=m;
m=1;
}
else {
test[t].local_rank=rank;
m++;
}
}
k_old+=k;
}
sort(test,test+k_old,cmp);
int rank=1;
int score = test[0].score;
test[0].final_rank=rank;
int m = 1;
int t;
for(t=1;t<k_old;t++){
if(test[t].score!=score){
score=test[t].score;
test[t].final_rank=rank+m;
rank+=m;
m=1;
}
else {
test[t].final_rank=rank;
m++;
}
}
printf("%d
",k_old);
for(i=0;i<k_old;i++){
printf("%s %d %d %d
",test[i].id,test[i].final_rank,test[i].location_number,test[i].local_rank);
}
return 0;
}