1025. PAT Ranking (25)
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 85Sample 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
这是一道中等难度的题目,目的是对每个考点的考生进行排名,其中要进行两次排名,一次为同一考点内学生的排名,一次为所有考点所有考生的总排名。先用一个结构体Term保存每个考生的ID号、分数、考场号、当地排名和总排名。函数comp是对考生分数做一个降序排列,当考生分数相等时再对考生ID号做一个升序排列。程序中我们用#include<algorithm>中的函数sort进行排列。代码如下
#include<vector>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
typedef struct term{
string ID;
int score;
int final_rank;
int location_number;
int local_rank;
}Term;
bool comp( const Term& a , const Term& b ){
if ( a.score > b.score )
return true;
else if ( a.score == b.score && a.ID < b.ID )
return true;
else
return false;
}
int main(){
vector<Term> seq,subseq;
Term temp;
int num_test,num,i,j;
cin>>num_test;
//--------------输入选手名单和成绩-------------------
for ( i = 0 ; i < num_test ; i++ ){
cin>>num;
for ( j = 0 ; j < num ; j++ ){
cin>>temp.ID>>temp.score;
subseq.push_back( temp );
}
sort( subseq.begin() , subseq.end() , comp );
subseq[0].local_rank = 1;
subseq[0].location_number = i + 1;
for ( j = 1 ; j < num ; j++ ){
subseq[j].location_number = i + 1 ;
if ( subseq[ j ].score == subseq[ j - 1 ].score )
subseq[ j ].local_rank = subseq[ j - 1 ].local_rank ;
else
subseq[j].local_rank = j + 1 ;
}
seq.insert( seq.end() , subseq.begin() , subseq.end() );
subseq.clear();
}
sort( seq.begin() , seq.end() , comp );
if ( !seq.empty() )
seq[0].final_rank = 1;
for ( int i = 1 ; i < seq.size() ; i++ ){
if ( seq[ i ].score == seq[ i - 1 ].score )
seq[ i ].final_rank = seq[ i - 1 ].final_rank ;
else
seq[i].final_rank = i + 1;
}
cout<<seq.size()<<endl;
for ( i = 0 ; i < seq.size() ; i++ ){
cout<<seq[i].ID<<" "<<seq[i].final_rank<<" "<<seq[i].location_number<<" "<<seq[i].local_rank<<endl;
}
return 0;
}