PAT(甲) 1025 PAT Ranking (25)

最新推荐文章于 2021-05-29 23:44:42 发布

LqbRoger

最新推荐文章于 2021-05-29 23:44:42 发布

阅读量175

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级算法笔记文章标签：排序

本文链接：https://blog.youkuaiyun.com/LqbRoger/article/details/89847981

算法笔记同时被 2 个专栏收录

10 篇文章

订阅专栏

PAT甲级

1 篇文章

订阅专栏

PAT考试由浙江大学计算机学院组织，需合并各考点排名生成最终排名。输入包含考点数、各考点考生数及考生信息，输出为考生总数和最终排名列表，排名按分数和考号排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct Student {
	char id[15];
	int score;
	int local_rank;
	int location;
} stu[300100];

//按分数排 分数相同按id排 
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;
	scanf("%d",&n); 
	int num = 0;
	for(int i = 1; i <= n; i++) {
		int k;
		scanf("%d",&k);
		for(int j = 0; j < k; j++) {
			scanf("%s %d",stu[num].id,&stu[num].score);
			stu[num].location = i;
			num++;
		}
		
		//local_rank排序 
		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 %d %d %d\n",stu[i].id,r,stu[i].location,stu[i].local_rank);
	}
	return 0;
}