PAT A1083

• 题目：
  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.将学生姓名，学号，成绩放入一个结构体，并将成绩大于low，小于等于high的存入res.
  2.将res中的学生按照成绩从大到小排名
  3.输出res学生的姓名，学号。

代码实现：

#include<iostream>
#include<string>
#include <algorithm>
using namespace std;
struct student{
    string name, id;
    int score;
}stu[110], res[110];
bool cmp(student a, student b){
    return a.score > b.score;
}
int main()
{
    int num;
    cin >>num;
    for(int i =0; i < num; i++){
        cin >> stu[i].name >> stu[i].id >> stu[i].score;
    }
    int low,high;
    cin >> low >> high;
    int k = 0;
    for(int i = 0; i < num; i++){
        if(stu[i].score >= low && stu[i].score <=high){
            res[k] = stu[i];
            k++;
        }
    }
    sort(res, res+k,cmp);
    if(k == 0)
        cout <<"NONE";
    for(int i = 0; i< k; i++){
        cout << res[i].name << " " << res[i].id<<endl;
    }
    return 0;
}