Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1012. 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.

Input

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.

Output

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".

Sample Input

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

Sample Output

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

解答

#include <cstdio>
#include <map>
#include <vector>
using namespace std;

int main()
{
	map<int, vector<int> > mp;
	int n, m; scanf("%d%d", &n, &m);
	
	while (n--)
	{
		int id, s[4]; 
		scanf("%d%d%d%d", &id, s+1, s+2, s+3); s[0] = (s[1]+s[2]+s[3]) / 3;
		for (int i = 0; i < 4; i++) mp[id].push_back(s[i]);
	}
	
	while (m--)
	{
		int id; scanf("%d", &id);
		if (mp.find(id) == mp.end())
		{
			printf("N/A\n"); continue;
		}

		int bestr = 10000, s;
		for (int i = 0; i < 4; i++)
		{			
			int score = mp[id][i], rnk = 1;
			for (map<int, vector<int> >::iterator p = mp.begin(); p != mp.end(); p++)
				if (p->second[i] > score) rnk++; //多少人分数更高
			if (rnk < bestr) bestr = rnk, s = i;
		}

		printf("%d %c\n", bestr, "ACME"[s]);
	}

	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论