1036 Boys vs Girls (25分)

 

#include<cstdio>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<set>
#include<algorithm>
#define maxn 22
using namespace std;
struct node {
    string name, id;
    char gender;
    int grade;
    node(string n, char gen, string i, int g) : name(n), gender(gen), id(i), grade(g) {}
    node() {}
    bool operator < (const node &a) const {
        if (a.gender != gender) return gender > a.gender;
        else return grade < a.grade;
    }
};
vector<node> v;

int main() {
    int N;
    node a;
    scanf("%d", &N);
    for (int i = 0; i < N; i++) {
        cin >> a.name >> a.gender >> a.id >> a.grade;
        v.push_back(a);
    }
    sort(v.begin(), v.end());
    bool na = false;
    int last = v.size() - 1;
    if (v[last].gender == 'F') {
        cout << v[last].name << ' ' << v[last].id << endl;
    }
    else {
        na = true;
        cout << "Absent" << endl;
    }

    if (v[0].gender == 'M') {
        cout << v[0].name << ' ' << v[0].id << endl;
    }
    else {
        na = true;
        cout << "Absent" << endl;
    }

    if (na) cout << "NA" << endl;
    else cout << v[last].grade - v[0].grade << endl;

    return 0;
}