#include<iostream> #include<algorithm> using namespace std; const long N = 999999; struct student{ char name[15]; char id[15]; int grade; }stu[N]; bool cmp(const student& s1, const student& s2){//这里必须用const student&类型!!否则编译错误 return s1.grade >= s2.grade; } int n; int low, high; int flag = 0; int main(){ cin >> n; for (int i = 0; i < n; i++){ cin >> stu[i].name >> stu[i].id >> stu[i].grade; } cin >> low >> high; sort(stu, stu + n, cmp); int i = 0; for (i = 0; i < n; i++){ if (stu[i].grade <= high) break; } for (; stu[i].grade >= low; i++){ cout << stu[i].name << " "; cout << stu[i].id << endl; flag = 1; } if (!flag) cout << "NONE"; return 0; }