A1025 PAT Ranking (25分)【C语言】

A1025 PAT Ranking (25分)【C语言】

原题链接

主要就是倒清楚组内的代号关系，其他和之前的大同小异，一个cmp函数进行排序，然后按照题目要求进行输出。
晴神的代码…

题目描述：
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.

输入格式：
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.

输出格式：
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.

输入样例：

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

输出样例：

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 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, i, j, num=0;
	scanf("%d", &n);
	for(i=1; i<=n; ++i){
		scanf("%d", &k);
		for(j=0; j<k; ++j){
			scanf("%s %d", stu[num].id, &stu[num].score);
			stu[num].location_number = i;
			num++; //总考生数加1 
		}
		sort(stu+num-k, stu+num, cmp); //将当前考场内的考生排序
		stu[num-k].local_rank = 1; //当前组第一排名设为1
		for(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(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;
}