-
Notifications
You must be signed in to change notification settings - Fork 0
/
A1012.cpp
71 lines (66 loc) · 1.29 KB
/
A1012.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
* author: zhouyuhao
* created: 2023-03-23 13:29:01
* modified: 2023-03-24 19:58:17
* item: Programming Ability Test
* site: Yuting
*/
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct stu {
int id;
int s[4];
int r[4];
int rank;
char subject;
};
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<stu> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i].id;
double avg = 0;
for (int j = 0; j < 3; j++) {
cin >> d[i].s[j + 1];
avg += d[i].s[j + 1];
}
d[i].s[0] = avg / 3 + 0.5;
}
for (int i = 0; i < 4; i++) {
sort(d.begin(), d.end(), [i](stu a, stu b) -> bool {
return a.s[i] > b.s[i];
});
d[0].r[i] = 1;
for (int j = 1; j < n; j++) {
if (d[j].s[i] == d[j - 1].s[i]) {
d[j].r[i] = d[j - 1].r[i];
} else {
d[j].r[i] = j + 1;
}
}
}
char trans[4] = {'A', 'C', 'M', 'E'};
for (int i = 0; i < n; i++) {
int j = min_element(d[i].r, d[i].r + 4) - d[i].r;
d[i].rank = d[i].r[j];
d[i].subject = trans[j];
}
map<int, stu> q;
for (auto it : d) {
q.emplace(make_pair(it.id, it));
}
for (int i = 0; i < m; i++) {
int id;
cin >> id;
if (q.find(id) == q.end()) {
cout << "N/A\n";
} else {
cout << q[id].rank << " " << q[id].subject << "\n";
}
}
return 0;
}