1083. List Grades (25) 好久没做过这么简单的题目了

//思路：按照成绩的非递增顺序排序 输出给定区间的name和id
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
using namespace std;

struct node {
    string name, id;
    int grade;
};
bool cmp(node a, node b){
    return a.grade >= b.grade;
}

int main(){
    int n, s, e;
    cin >> n;
    vector<node> nodes(n), v;

    for (int i = 0; i < n; i++) {
        string a, b; int grade;
        cin >> a >> b >> grade;
        nodes[i] = {a, b, grade};
    }
    cin >> s >> e;
    for (int i = 0; i < n; i++) {
        if (nodes[i].grade >= s && nodes[i].grade <= e)
            v.push_back(nodes[i]);
    }

    if (v.size() > 0) {
        sort(v.begin(), v.end(), cmp);
        //cout << v.size() << endl;
        for (int i = 0; i < v.size(); i++) {
            cout << v[i].name << ' ' << v[i].id << endl;
        }
    }else{
        cout << "NONE\n";
    }

    return 0;
}