PAT a1012题解

#include <cstdio>
#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;
	}
	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;
}