PAT甲级——PAT Ranking

题目描述

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

 

思路:

      在结构体类型Student中存放题目要求的信息（准考证号、分数、考场号以及考场内排名），根据题目要求写一个cmp排序函数，规则如下：

1. 当分数不同时，按分数从大到小排序。
2. 否则，按准考证号从小到大排序。

算法的本体分为三个部分：

步骤一：按考场读入各考生的信息，并对当前读入考场的所有考生进行排序，之后将该考场的所有考生的排名写入他们的结构体中。

步骤二：对所有考生排序。

步骤三：按照顺序一边计算总排名，一边输出所有考生的信息。

#include <iostream>
#include<algorithm>
#include<cstring>
using namespace std;

struct Student {
	char id[15];
	int score;
	int location;
	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 = 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, stu[i].local_rank);
	}
	return 0;
}

思路：

        整体思路和上面说的一样，但是 细节的东西要好好揣摩一下，定义结构体的时候，我开始想用二维的结构体，第一维是考场，第二维是该考场的考生，然后用结构体指针来访问所有的数据。后来发现没有必要，其实可以直接定义一维的结构体，然后开始的时候按考场顺序分段排序，最后再整体排序，这里要注意的是排序的时候，各区间的首尾编号的问题，还有考生排名的的判断，这些地方很容易弄错。

二刷代码：

#include <iostream>
#include<algorithm>
#include<cstring>
using namespace std;

struct Student {
	char id[15];
	int score;
	int location;
	int final_rank;
	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 = 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, stu[i].local_rank);
	}
	return 0;
}