PAT 1083

#include <vector>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

struct Student{
    int grade;
    string name;
    string id;
};

bool compare(const Student &s1, const Student &s2){
    return s1.grade > s2.grade;
}

int main(){
    int N;
    cin >> N;

    vector<Student> students;

    for (int i = 0; i < N; i++){
        Student s;
        cin >> s.name >> s.id >> s.grade;

        students.push_back(s);
    }

    int low, high;
    cin >> low >> high;

    sort(students.begin(), students.end(), compare);
    bool none = true;
    for (int i = 0; i < students.size(); i++){
        if (students[i].grade < low)
            break;
        if (students[i].grade > high)
            continue;

        none = false;
        cout << students[i].name << " " << students[i].id << endl;
    }

    if (none)
        cout << "NONE" << endl;

    return 0;
}