PAT-A1012

#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
    int id;
    int grade[4];
}stu[2010];
int now;
int rk[10000000][4] = {0};
char c[4] = {'A', 'C', 'M', 'E'};
bool cmp(node a, node b){
    return a.grade[now] > b.grade[now];//不能加if(a.grade[now] != b.grade[now] != 0!!!
}
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] = stu[i].grade[1] + stu[i].grade[2] + stu[i].grade[3];
    }
    for(now = 0; now < 4; now++){
        sort(stu, stu + n, cmp);
        rk[stu[0].id][now] = 1;
        for(int j = 1; j < n; j++){
            if(stu[j].grade[now] == stu[j - 1].grade[now]){
                rk[stu[j].id][now] = rk[stu[j - 1].id][now];
            }
            else{
                rk[stu[j].id][now] = j + 1;//别忘了+1！！
            }
        }
    }
    int id;
    for(int i = 0; i < m; i++){
        scanf("%d", &id);
        if(rk[id][0] == 0){
            printf("N/A\n");
        }
        else{
            int min = 0;
            for(int j = 0; j < 4; j++){
                if(rk[id][j] < rk[id][min]){
                    min = j;
                }
            }
            printf("%d %c\n", rk[id][min], c[min]);
        }
    }
    return 0;
}