1083 List Grades

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:

Nname[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:

4Tom CS000001 59Joe Math990112 89Mike CS991301 100Mary EE990830 9560 100

Sample Output 1:

Mike CS991301Mary EE990830Joe Math990112

Sample Input 2:

2Jean AA980920 60Ann CS01 8090 95

Sample Output 2:

NONE

#include<iostream>#include<vector>#include<string>#include<algorithm>using namespace std;struct student{string name;string ID;int grade;};bool cmp(const student& stu1,const student& stu2){if(stu1.grade < stu2.grade){return true;}else{return false;}}int main(){for(int n;cin>>n;){vector<student>students;for(int i = 0;i < n; i++){student temp;cin>>temp.name>>temp.ID>>temp.grade;students.push_back(temp);}sort(students.begin(),students.end(),cmp);int min,max;cin>>min>>max;int count = 0;for(int i = students.size()-1;i > -1;i--){if(students[i].grade >= min && students[i].grade <= max){cout<<students[i].name<<" "<<students[i].ID<<endl;count++;}}if(!count){cout<<"NONE"<<endl;}}return 0;}