PAT甲级 1083 List Grades

A1083. PAT 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个考生信息，和成绩区间，按成绩从高到低的顺序输出在成绩区间的考生ID和姓名，如果没有输出NONE。

思路：
1.先对所有考生排序
2.再对所有考生判断是否在成绩区间并输出信息，设置全局变量num,对不在区间内的考生num++
3.num=N时，输出NONE

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct student{
    char id[11];
    char name[11];
    int grade;
}stu[10010];
bool cmp(student a,student b){
    return a.grade>b.grade;
}
int main()
{
    int n,a,b,num=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%s %s %d",stu[i].id,stu[i].name,&stu[i].grade);
    }
    sort(stu,stu+n,cmp);
    scanf("%d %d",&a,&b);
    for(int i=0;i<n;i++){
        if(stu[i].grade>=a&&stu[i].grade<=b){
            printf("%s %s\n",stu[i].id,stu[i].name);
        }
        else num++;
    }
    if(num==n)  printf("NONE");
    return 0;
}