这道题考点应该是map<string, 结构体>,其他的都是基础。
四舍五入,(int)(num + 0.5);
#include<bits/stdc++.h>
using namespace std;
struct stu {
int Gp, Gm = -1, Gf = -1, G;
string id;
};
unordered_map<string, stu> mp;
vector<stu> v;
bool cmp (stu a, stu b) {
if (a.G != b.G) return a.G > b.G;
return a.id < b.id;
}
int main() {
int p, m, n, g;
scanf ("%d %d %d", &p, &m, &n);
string id;
for (int i = 0; i < p; i++) {
cin >> id >> g;
mp[id].Gp = g;
mp[id].id = id;
}
for (int i = 0; i < m; i++) {
cin >> id >> g;
mp[id].Gm = g;
}
for (int i = 0; i < n; i++) {
cin >> id >> g;
mp[id].Gf = g;
}
for (auto it : mp) {
stu st = it.second;
if ((st.Gp <= 900 && st.Gp >= 200) && (st.Gm <= 100 && st.Gf <= 100)) {
if (st.Gf >= st.Gm) st.G = st.Gf;
else st.G = (int)(st.Gm * 0.4 + st.Gf * 0.6 + 0.5);
if (st.G >= 60) v.push_back(st);
}
}
sort (v.begin(), v.end(), cmp);
for (auto it : v) printf ("%s %d %d %d %d\n", it.id.c_str(), it.Gp, it.Gm, it.Gf, it.G);
}