PATA1036_STL（难度：⭐️）

没难度上代码。

---

#include <bits/stdc++.h>
using namespace std;
struct node {
    string name, id;
    int grade;
};
vector<vector<node>> v(2);
bool cmp1 (node a, node b) {
    return a.grade > b.grade;
}
bool cmp2 (node a, node b) {
    return a.grade < b.grade;
}
int main() {
    string name, g, id;
    int n, grade, flag = 0;
    scanf ("%d", &n);
    for (int i = 0; i < n; i++) {
        cin >> name >> g >> id >> grade;
        if (g[0] == 'F') v[0].push_back(node{name, id, grade});
        else v[1].push_back(node{name, id, grade});
    }
    sort (v[0].begin(), v[0].end(), cmp1);
    sort (v[1].begin(), v[1].end(), cmp2);
    if (v[0].size() == 0) {
        printf ("Absent\n");
        flag = 1;
    }
    else printf ("%s %s\n", v[0][0].name.c_str(), v[0][0].id.c_str());
    if (v[1].size() == 0) {
        printf ("Absent\n");
        flag = 1;
    }
    else printf ("%s %s\n", v[1][0].name.c_str(), v[1][0].id.c_str());
    if (flag == 0) printf ("%d", v[0][0].grade - v[1][0].grade);
    else printf ("NA");
}