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 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

 1 #include<iostream>
 2 #include<vector>
 3 #include<algorithm>
 4 using namespace std;
 5 struct node{
 6   char name[15], id[15];
 7   int score;
 8 };
 9 
10 bool cmp(node a, node b){return a.score>b.score;}
11 int main(){
12   int n, i;
13   scanf("%d", &n);
14   vector<node> v(n);
15   for(i=0; i<n; i++) scanf("%s %s %d", v[i].name, v[i].id, &v[i].score);
16   int maxx, minn;
17   scanf("%d%d", &minn, &maxx);
18   bool f = true;
19   sort(v.begin(), v.end(), cmp);
20   for(i=0; i<n; i++){
21     if(minn<=v[i].score && maxx>=v[i].score){
22       printf("%s %s\n", v[i].name, v[i].id); 
23       f=false;
24     }else if(!f) break;
25   }
26   if(f) printf("NONE\n");
27   return 0;
28 }

 

转载于:https://www.cnblogs.com/mr-stn/p/9163897.html