pat1137 Final Grading

题意：按成绩排序。

思路：。。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>

using namespace std;


const int MAX_N = 100000;
struct Data {
    string name;
    int sco;
    int m, f, l;

    bool operator < (const Data& d) const {
        return l > d.l || (l == d.l && name < d.name);
    }
};

int p, m, f;
string s;
int sco;
int grade;
map<string, Data> mp;
vector<Data> ans;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    cin >> p >> m >> f;
    for (int i = 0; i < p; i++) {
        cin >> s >> sco;
        if (sco >= 200) {
            Data& d = mp[s];
            d.sco = sco;
            d.name = s;
            d.f = -1;
            d.m = -1;
        }
    }
    for (int i = 0; i < m; i++) {
        cin >> s >> grade;
        if (mp.count(s))
            mp[s].m = grade;
    }
    for (int i = 0; i < f; i++) {
        cin >> s >> grade;
        if (!mp.count(s)) continue;
        Data& d = mp[s];
        d.f = grade;
        if (d.m != -1) {
            d.l = (1.0 * d.m * 0.4 + 1.0 * d.f * 0.6 + 0.5);
            if (d.m <= d.f) d.l = d.f; 
        } else {
            d.l = d.f;
        }
    }
    for (auto it = mp.begin(); it != mp.end(); it++) {
        if (it->second.l >= 60)
            ans.push_back(it->second);
    }
    sort(ans.begin(), ans.end());
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i].name << " " << ans[i].sco << " " << ans[i].m << " " << ans[i].f << " " << ans[i].l << endl;
    }
    return 0;
}