1012 The Best Rank (25)

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

思路

题目给N个学生的C\M\E的成绩，再根据这三门成绩分别得到他们的平均分，再分别对相应科目排名，都会有一个排名，也会有一个最高的名次。有M个查询，输出该学生最高的一科排名和对应的字母，若存在相同排名的科目，则按照A > C > M > E输出最高的排名，若不存在则输出N/A。

建立结构体存储学生的成绩、id号、每科的排名、最好一科排名的下标。

排名并列应该1、1、3、4、5，而不是1、1、2、3、4，否则会有一个测试点不过

平均分是四舍五入的，所以需要按照+0.5后取整，保证是四舍五入的

存储的时候就按照ACME的顺序存储可以简化程序逻辑

C++：

#include "cstdio"
#include "algorithm"
#include "cmath"
#include "iostream"
using namespace std;

struct MyStruct
{
	int id;//id号
	int score[4];//四项成绩
	int rank[4];//四项排名
	int best;//最好排名下标
}stu[2001];

char course[5]={'A','C','M','E'};

int sum(MyStruct stu){
	int sum=0;
	for (int i=1;i<4;i++)
	{
		sum+=stu.score[i];
	}
	return sum;
}

int flag=-1;
bool cmp(MyStruct a,MyStruct b){
	return a.score[flag]>b.score[flag];
}

int exist[1000001];//标记存入的id

int main(){
	int n,m;
	cin>>n>>m;
	fill(exist,exist+1000000,-1);
	//读入N个学生成绩 并计算平均分
	for(int i=0;i<n;i++){
		cin>>stu[i].id>>stu[i].score[1]>>stu[i].score[2]>>stu[i].score[3];
		stu[i].score[0]=sum(stu[i])/3.0+0.5;
	}
	//排名
	for (flag=0;flag<4;flag++)
	{
		sort(stu,stu+n,cmp);
		stu[0].rank[flag]=1;//记录当前flag成绩下的第一名
		for (int i=1;i<n;i++)
		{
			if (stu[i].score[flag]==stu[i-1].score[flag])
			{
				stu[i].rank[flag]=i;//排名相同的情况
			}else{
				stu[i].rank[flag]=i+1;//记录当前flag成绩下的其余排名
			}
		}
	}
	//找出排名最高的成绩的下标
	for (int i=0;i<n;i++)
	{
		int a=0;
		for (int j=1;j<4;j++)
		{
			if (stu[i].rank[j]<stu[i].rank[a])
			{
				a=j;//小于它才更新
			}
		}
		stu[i].best=a;
		exist[stu[i].id]=i;//标记这个已存入 记录其在stu中的下标
	}
	int temp=0;
	for (int i=0;i<m;i++)
	{
		cin>>temp;
		if (exist[temp]!=-1)
		{
			int x=exist[temp];
			cout<<stu[x].rank[stu[x].best]<<" "<<course[stu[x].best]<<endl;
		}else{
			cout<<"N/A"<<endl;
		}
	}
	return 0;
}