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 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我写成了输出。。。
还有忘了写using namespace std;
要点就是,理清楚数组的起始和终止的下标 and 好好利用数组下标可以少定义变量。
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
struct info{ //结构体里没有存放final rank 因为最后按照总排名直接输出
char number[15];
int score;
int lc_n;
int lc_r;
}stu[30010]; //本来想定义2D数组,但是没法用sort()总排序
bool cmp(info a,info b){
if(a.score != b.score ) return a.score > b.score;
else return strcmp(a.number,b.number) < 0 ;
}
int main(){
int N;
scanf("%d",&N);
int cnt = 0;
int K;
for(int i = 1;i<=N;i++) {
scanf("%d",&K);
for(int j = 0;j < K; j++) {
scanf("%s %d",&stu[cnt].number,&stu[cnt].score);
stu[cnt].lc_n = i;
cnt++;
}
sort(stu+cnt-K,stu+cnt,cmp); //本考场排序
stu[cnt-K].lc_r=1;//本考场排名
for(int j = cnt-K+1;j<cnt;j++) {
if(stu[j].score == stu[j-1].score) stu[j].lc_r = stu[j-1].lc_r;
else stu[j].lc_r = j+1-(cnt-K);
}
}
printf("%d\n",cnt);
sort(stu,stu+cnt,cmp);
int r = 1; //总名次排名
for(int i = 0;i<cnt;i++) {
if( i>0 && stu[i].score != stu[i-1].score) {
r = i+1;
}
printf("%s %d %d %d\n",stu[i].number,r,stu[i].lc_n,stu[i].lc_r);
}
return 0;
}