1 /**************************************************
 2 PAT A1012 The Best Rank
 3 **************************************************/
 4 #include <iostream>
 5 #include <cmath>
 6 #include <algorithm>
 7 #include <string>
 8 #include <vector>
 9 
10 using namespace std;
11 
12 struct StudInfo {
13     string id = "";
14     int score[4] = { 0 };
15     int rank[4] = { 0 };
16 };
17 
18 bool comByC(StudInfo a, StudInfo b) { return a.score[0] > b.score[0]; }
19 bool comByM(StudInfo a, StudInfo b) { return a.score[1] > b.score[1]; }
20 bool comByE(StudInfo a, StudInfo b) { return a.score[2] > b.score[2]; }
21 bool comByA(StudInfo a, StudInfo b) { return a.score[3] > b.score[3]; }
22 
23 bool (*cmp[4])(StudInfo, StudInfo) = { comByC, comByM, comByE, comByA };
24 
25 void printBestRank(int aRank, int cRank, int mRank, int eRank) {
26     if (aRank <= cRank && aRank <= mRank && aRank <= eRank) cout << aRank << " A";
27     else if (aRank > cRank && cRank <= mRank && cRank <= eRank) cout << cRank << " C";
28     else if (aRank > mRank && cRank > mRank && mRank <= eRank) cout << mRank << " M";
29     else cout << eRank << " E";
30 }
31 
32 int main() {
33     int stuCount = 0, checkCount = 0;
34 
35     cin >> stuCount >> checkCount;
36 
37     vector<StudInfo> stuList(stuCount);
38 
39     //获取三门课的成绩并计算平均成绩
40     for (int i = 0; i < stuCount; ++i) {
41         cin >> stuList[i].id >> stuList[i].score[0] >> stuList[i].score[1] >> stuList[i].score[2];
42         stuList[i].score[3] = round((stuList[i].score[0] + stuList[i].score[1] + stuList[i].score[2])) / 3.0 + 0.5;
43     }
44 
45     //分别按照每门课进行排序
46     for (int i = 0; i < 4; ++i) {
47         sort(stuList.begin(), stuList.end(), cmp[i]);
48 
49         stuList[0].rank[i] = 1;
50         for (int j = 1; j < stuCount; ++j) {
51             stuList[j].rank[i] = stuList[j].score[i] == stuList[j - 1].score[i] ? stuList[j - 1].rank[i] : j + 1;
52         }
53     }
54 
55     //输出查询的结果
56     string checkStuId;
57     for (int i = 0; i < checkCount; ++i) {
58         bool findFlag = false;            //是否找到要查询的学生的信息
59 
60         cin >> checkStuId;
61 
62         for (int j = 0; j < stuCount; ++j) {
63             if (checkStuId == stuList[j].id) {
64                 printBestRank(stuList[j].rank[3], stuList[j].rank[0], stuList[j].rank[1], stuList[j].rank[2]);
65                 findFlag = true;
66                 break;
67             }
68         }
69 
70         if (!findFlag) cout << "N/A";
71 
72         if (i != checkCount - 1) cout << endl;  //换行
73     }
74 
75     return 0;
76 }