PAT甲级1083 List Grades (25point(s))

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.
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
排序水题
AC代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
struct student{
    char name[11];
    char id[11];
    int grade;
    bool operator<(const student &a)const{
return grade>a.grade;
    }
};
vector<student>v;
int main(){
    int n,grade1,grade2;
    student temp;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
    scanf("%s %s %d",temp.name,temp.id,&temp.grade);
    v.push_back(temp);}
    sort(v.begin(),v.end());
    scanf("%d %d",&grade1,&grade2);
   bool flag=false;
    for(int it=0;it!=v.size();it++){
if(v[it].grade>=grade1&&v[it].grade<=grade2){
printf("%s %s\n",v[it].name,v[it].id);
flag=true;
}
if(v[it].grade<grade1){
    break;
}
    }
    if(!flag){
        printf("NONE");
    }
    system("pause");
    return 0;
}