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 grade2where 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: NONE 原题链接； https://www.patest.cn/contests/pat-a-practise/1083https://www.nowcoder.com/pat/1/problem/4313
思路：
结构体排序，然后条件判断
CODE：
#include<iostream> #include<algorithm> #include<cstring> #include<string> #include<vector> using namespace std; typedef struct S { string name; string id; int gra; }; vector<S> vec; bool cmp(S a, S b) { return a.gra>b.gra; } int main() { int n; cin>>n; for (int i=0;i<n;i++) { S t; cin>>t.name>>t.id>>t.gra; vec.push_back(t); } int mi,ma; cin>>mi>>ma; sort(vec.begin(),vec.end(),cmp); int bg=0; while (vec[bg].gra<mi||vec[bg].gra>ma) { bg++; if (bg>=vec.size()) break; } if (bg>=vec.size()) { cout<<"NONE"; } else { for (int i=bg;;i++) { if (vec[i].gra>ma||vec[i].gra<mi) break; cout<<vec[i].name<<" "<<vec[i].id<<endl; } } return 0; }
