题目:有n个考场,每个考场有若干数量的考生,现在给出各个考场中考生的准考证号与分数,要求将所有考生按分数从高到底排序,并按顺序输出所有考生的准考证号,排名,考场号以及考场内排名
Input:
2
5
1234001 95
1234002 100
1234003 95
1234004 77
1234005 85
4
1235001 65
1235002 25
1235003 100
1235004 85
Ouput:
9
1234002 1 1 1(对应准考证号,排名,考场号以及考场内排名)
1235003 1 2 1
……
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct Student{
char id[15];
int score;
int location_number; //考场号
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,k,num = 0;
scanf("%d",&n);
for(int 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_number = 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(int i= 0;i<num;i++){
if(i>0 && stu[i].score != stu[i-1].score){
r = i + 1;
}
printf("%s ",stu[i].id);
printf("%d %d %d\n",r,stu[i].location_number,stu[i].local_rank);
}
return 0;
}