PAT甲级——The Best Rank

题目描述

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and E - English.  At the mean time, we encourage students by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.
For example, The grades of C, M, E and A - Average of 4 students are given as the following:
StudentID  C  M  E  A
310101     98 85 88 90
310102     70 95 88 84
310103     82 87 94 88
310104     91 91 91 91
Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.

 

输入描述:

Each input file contains one test case.  Each case starts with a line containing 2 numbers N and M (<=2000), which are the total number of students, and the number of students who would check their ranks, respectively.  Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E.  Then there are M lines, each containing a student ID.

 

输出描述:

For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.
The priorities of the ranking methods are ordered as A > C > M > E.  Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.
If a student is not on the grading list, simply output "N/A".

 

输入例子:

5 6
310101 98 85 88
310102 70 95 88
310103 82 87 94
310104 91 91 91
310105 85 90 90
310101
310102
310103
310104
310105
999999

 

输出例子:

1 C
1 M
1 E
1 A
3 A
N/A

思路：

1.用结构体Student来存放学生的Id和四个成绩（A、C、M、E），再用Rank[10000000][4]数组来存放学生Id对应的四门课程的排名；

2.读入学生信息，并计算平均成绩；

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

struct Student {
	int id;
	int grade[4];
}stu[2010];

char course[4] = { 'A','C','M','E' };
int Rank[10000000][4] = { 0 };
int now;

bool cmp(Student a, Student b)
{
	return a.grade[now] > b.grade[now];
}

int main()
{	
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d%d%d", &stu[i].id, &stu[i].grade[1], &stu[i].grade[2], &stu[i].grade[3]);
		stu[i].grade[0] = round((stu[i].grade[1] + stu[i].grade[2] +
			stu[i].grade[3]) / 3.0)+0.5 ;//这里感觉有些奇怪，可以不加0.5，或者不使用round都可以通过测试点，官网亲测是可以的;
	}
	for (now = 0; now < 4; now++)
	{
		sort(stu, stu + n, cmp);
		Rank[stu[0].id][now] = 1;
		for (int i = 1; i < n; i++)
		{
			if (stu[i].grade[now] == stu[i - 1].grade[now])
			{
				Rank[stu[i].id][now] = Rank[stu[i - 1].id][now];
			}
			else {
				Rank[stu[i].id][now] = i + 1;
			}
		}
	}
	int query;
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &query);
		if (Rank[query][0] == 0) {
			printf("N/A\n");
		}
		else {
			int k=0;
			for (int j = 0; j < 4; j++)
			{
				if (Rank[query][j] < Rank[query][k])
					k = j;
			}
			printf("%d %c\n", Rank[query][k], course[k]);
		}
			
	}
	return 0;

}

 

复习： 

这道题看起来没什么难度，但是做的时候如果只想到了建立结构体来存储学生的数据，比如将id作为结构体数组的下标，结构体里面存放考生的四门课程成绩，这样就无法根据结构体数组的排序去得到，学生每门课程的排名。所以需要专门建立一个Rank[1000000][4]数组来存储对应编号的学生的课程排名，同时结构体数组开到比学生数量多一点就行了，然后分别根据四门课程的成绩对结构体数组进行排序，同时在Rank里面记录排名，要注意这个排名有个隐含的要求，有并列的情况排名可以是1 2 2 4 5，但不是1 2 2 3 4，所以在计算排名的时候要按照代码所示那样去处理，不然有个测试点会通不过。

二刷代码：

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

struct Student
{
	int id;
	int grades[4];
}stu[2010];

int Rank[10000000][4] = { 0 };//一定要开大一点，别顺手就开个2010，会段错误的
int index ;
char course[4] = { 'A','C','M','E' };
bool cmp(Student a, Student b)
{
	return a.grades[index] > b.grades[index];
}

int main()
{
	int n, m,ID;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d%d%d", &stu[i].id, &stu[i].grades[1], &stu[i].grades[2], &stu[i].grades[3]);
		stu[i].grades[0] = round((stu[i].grades[1] + stu[i].grades[2] + stu[i].grades[3]) / 3.0);

	}
	for (index = 0; index < 4; index++)
	{
		sort(stu, stu + n, cmp);
		Rank[stu[0].id][index] = 1;
		for (int i = 1; i < n; i++)
		{
			if (stu[i].grades[index] == stu[i - 1].grades[index])
			{
				Rank[stu[i].id][index] = Rank[stu[i - 1].id][index];
			}
			else {
				Rank[stu[i].id][index] = i + 1;//这里是i+1而不是Rank[stu[i - 1].id][index]+1
			}//也就是说，有并列的情况排名可以是1 2 2 4 5，但不是1 2 2 3 4，这里千万要注意
		}
	}
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &ID);
		if (Rank[ID][0] == 0) printf_s("N/A\n");
		else {
			int k = 0;
			for (int j = 0; j < 4; j++)
			{
				if (Rank[ID][j] < Rank[ID][k])
				{
					k = j;
				}
			}
			printf("%d %c\n", Rank[ID][k], course[k]);
		}
	}
	return 0;
}