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

題目大意：

給出每位學生單科成績，在幾項成績（包括平均成績）中找出排名最高的成績。

題目解析：

• 利用結構體儲存學生ID,單科成績,單科成績排名，最好成績；
• 用sort函式進行結構體排序，然後計算排名，注要意並列的情況；
• 用exist陣列儲存學號與陣列中序號的關係，方便查詢。

具體程式碼：

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

struct node{
	int id,best;
	int grade[4],rank[4];
}stu[2010];

int exist[1000000],flag=-1;
string s="ACME";

bool cmp(node a,node b){
	return b.grade[flag]<a.grade[flag];
}

int main()
{
    int n,m;
    cin>>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]=(stu[i].grade[1]+stu[i].grade[2]+stu[i].grade[3])/3;
	}
	
	//計算每個學生各項成績排名 
    for(flag=0;flag<4;flag++){
    	sort(stu,stu+n,cmp);
    	stu[0].rank[flag]=1;
    	for(int i=1;i<n;i++){
    		if(stu[i].grade[flag]==stu[i-1].grade[flag])
    			stu[i].rank[flag]=stu[i-1].rank[flag];
    		else
    			stu[i].rank[flag]=i+1;
		}
	}
	fill(exist,exist+1000000,-1);
	//計算學生最好排名的科目同時確定其ID與陣列序號的關係 
	for(int i=0;i<n;i++){
		exist[stu[i].id]=i;
		int min=0;
		for(int j=1;j<4;j++)
			if(stu[i].rank[j]<stu[i].rank[min])
				min=j;
		stu[i].best=min;
	}
	while(m--){
		int id,k;
		scanf("%d",&id);
		if(exist[id]==-1)
			printf("N/A\n");
		else{
			k=exist[id];
			printf("%d %c\n",stu[k].rank[stu[k].best],s[stu[k].best]);
		}
	}
    return 0;
}