PAT A1083. 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:

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 <cstdio>#include <algorithm>#include <cmath>#include <cstring>#define Max 1111111using namespace std;struct Stu{char Name[11];char ID[11];int score;}S[Max];bool cmp(Stu a,Stu b){return a.score>b.score;}int main(){int n,Sl,Sh;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%s %s %d",S[i].Name,S[i].ID,&S[i].score);}scanf("%d %d",&Sl,&Sh);sort(S,S+n,cmp);int k=0;for(int i=0;i<n;i++){if(S[i].score>=Sl&&S[i].score<=Sh){k++;printf("%s %s\n",S[i].Name,S[i].ID);}if(S[i].score<Sl) break;}if(k==0) printf("NONE\n");system("pause");return 0;}