接这一篇~ https://blog.csdn.net/abcdefggggghk/article/details/99611824 来个例题~
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个考场,每个考场有若干学生,给出各个考场学生的准考证号与分数,要求将所有考生按分数从高到低排序(分数相同则并列),并按顺序输出所有考生的准考证号、总排名、考场号以及考场内排名。
思路及步骤:
先排序,再排名
在结构体Student中存放题目要求的信息,包括准考证号、分数、考场号、以及考场内的排名。
根据题目要求,写一个排序函数cmp,规则如下:
1)当分数不同时,按分数从大到小排序。
2)否则,按准考证号从小到大排序。
代码如下:
bool cmp(student a,Student b){
if(a.score!=b.score)
return a.score>b.score;
else
return strcmp(a.id,b.id)<0;
}
算法部分为下面三个部分:
步骤1:按考场读入各考生的信息,并对当前读入考场的所有考生进行排序。之后将该考场的所有考生的排名写入它们的结构体中。
步骤2:对所有考生进行排序。
步骤3:按顺序一边计算总排名,一边输出所有考生的信息。
注意点:
对同一个考场的考生单独排序,先定义一个int型变量num,用来存储当前获取的考生人数,每读入一个考生的信息,就让num自增,这样读取完一个考场的考生信息后(假设该考场有k个考生),这个考场的考生对应的数组下标区间便为[num-k,num)。
AC代码:
#include<cstdio>
#include<cstring>
#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)
a.score>b.score;
else
return strcmp(a.id,b.id)<0;
}
int main(){
int n,k;
int num=0; //num为总考生数
scanf("%d",&n); //n为考场数
for(int i=1;i<=n;i++){ //i即充当为考场号
scanf("%d",&k); //k为当前考场内的学生数
for(int j=0;j<k;j++){
scanf("%s %d",stu[num].id,&stu[num].score);
stu[num].location_number=i; //该考生的考场号为i
num++; //总考生数加1
}
sort(stu+num-k,stu+num,cmp); //将当前考场的考生排序
stu[num-k]. local_rank=1; //当前考场的第一名的local_rank记为1
for(int j=num-k+1;j<num;j++){ //对该考场剩余的考生
if(stu[j].score==stu[j-1].score) //如果与前一个考生的分数相同
//则local_rank 也相同
stu[j].local_rank=stu[j-1].local_rank;
else // 如果与前一个考生的分数不同
stu[j].local_rank=j+1-(num-k); //则local_rank为该考生前的人数
}
}
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("%5d%5d%5d\n",r,stu[i].location_number,stu[i].local_rank);
}
return 0;
}