Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.
Input Specification:
Each input file contains one test case. Each case is given in the following format:
N
name[1] ID[1] grade[1]
name[2] ID[2] grade[2]
... ...
name[N] ID[N] grade[N]
grade1 grade2
where name[i] and ID[i] are strings of no more than 10 characters with no space, grade[i] is an integer in [0, 100], grade1 and grade2 are the boundaries of the grade's interval. It is guaranteed that all the grades are distinct.
Output Specification:
For each test case you should output the student records of which the grades are in the given interval [grade1, grade2] and are in non-increasing order. Each student record occupies a line with the student's name and ID, separated by one space. If there is no student's grade in that interval, output NONE instead.
Sample Input 1:
4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100
Sample Output 1:
Mike CS991301
Mary EE990830
Joe Math990112
Sample Input 2:
2
Jean AA980920 60
Ann CS01 80
90 95
Sample Output 2:
NONE1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 using namespace std; 5 struct Node 6 { 7 string name, id; 8 int grade; 9 }; 10 int main() 11 { 12 int N, grade1, grade2; 13 cin >> N; 14 Node* data = new Node[N]; 15 for (int i = 0; i < N; ++i) 16 cin >> data[i].name >> data[i].id >> data[i].grade; 17 cin >> grade1 >> grade2; 18 sort(data, data + N, [](Node a, Node b) {return a.grade > b.grade; }); 19 int flag = 1; 20 for (int i = 0; i < N; ++i) 21 { 22 if (data[i].grade < grade1) 23 break; 24 if (data[i].grade >= grade1 && data[i].grade <= grade2) 25 { 26 cout << data[i].name << " " << data[i].id << endl; 27 flag = 0; 28 } 29 } 30 if (flag == 1) 31 cout << "NONE" << endl; 32 delete[]data; 33 return 0; 34 }