PAT Advanced 1083 List Grades

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:

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

解题思路

按照递减顺序输出在指定区间[l, r]成绩的学生的姓名，id，sort排序即可。 如果不存在输出NONE。

解题代码

#include <iostream>
#include <algorithm>
using namespace std;
int n, l, r;
struct student{
    string name, id;
    int score;
}stu[1010];
bool cmp(student a, student b){
    return a.score > b.score;
}
int main(){
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        cin >> stu[i].name >> stu[i].id >> stu[i].score;
    }
    scanf("%d %d", &l, &r);
    sort(stu, stu + n, cmp);
    bool exist = false;
    for (int i = 0; i < n; i++){
        if (stu[i].score >= l &&  stu[i].score <= r){
            cout << stu[i].name << " " <<stu[i].id << endl;
            exist = true;
        }
    }
    if (exist == false) puts("NONE");
    return 0;
}