1083 List Grades（25 分）

#include
#include
#include
using namespace std;
const int maxn = 1e3 + 10;
struct node {
    string name, id;
    int grade;
    bool operator<(const node&x)const
    {
        return grade == x.grade ? : grade > x.grade;
    }
}a[maxn];
int n;
int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].name >> a[i].id >> a[i].grade;
    }
    int amin, amax;
    scanf("%d%d", &amin, &amax);
    sort(a, a + n);
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        if (a[i].grade >= amin&&a[i].grade <= amax)cout << a[i].name << " " << a[i].id << endl, cnt++;
    }
    if (cnt == 0)printf("NONE");
    return 0;
}