1083. List Grades (25)
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 100Sample Output 1:
Mike CS991301 Mary EE990830 Joe Math990112Sample Input 2:
2 Jean AA980920 60 Ann CS01 80 90 95Sample Output 2:
NONE
//1083. List Grades #include <iostream> #include <vector> #include <string> #include <algorithm> using namespace std; struct Student { string name; string id; int grade; }; bool cmp(const Student& s1, const Student& s2) { return s1.grade > s2.grade; } vector<Student> students(110); int main() { int stuNum; cin>>stuNum; for (int i = 0; i < stuNum; i++) cin>>students[i].name>>students[i].id>>students[i].grade; sort(students.begin(), students.end(), cmp); int grade1, grade2; cin >> grade1 >> grade2; bool flag = false; for (int i = 0; i < students.size(); i++) { if (students[i].grade >= grade1&&students[i].grade <= grade2) { cout<<students[i].name<<" "<<students[i].id<<endl; flag = true; } if (students[i].grade < grade1) break; } if (!flag) cout << "NONE"; return 0; }