1083 List Grades (25 分)

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

结尾无空行

解释：

输入

信息总数N

输入N行信息 包括name ID grade

在输入分数区间

输出：

符合分数区间的学生 信息，按分数增序

#include<algorithm>
#include<iostream>
#include<string>
using namespace std;

typedef struct student
{
    string name;
    string id;
    int grade;
}stu;
stu s[1001];

bool cmp(stu a, stu b)
{
    return a.grade>b.grade;
}
int main()
{
    int N,min_grade,max_grade,flag=0;
    cin>>N;
    for(int i=0;i<N;i++)
        cin>>s[i].name>>s[i].id>>s[i].grade;
    
    cin>>min_grade>>max_grade;
    //排序
    sort(s,s+N,cmp);
    for(int i=0;i<N;i++)
    {
        if(s[i].grade>=min_grade&&s[i].grade<=max_grade)
        {
            cout<<s[i].name<<" "<<s[i].id<<endl;
            flag=1;
        }
    }
    if(flag==0) cout<<"NONE";
    return 0;
}