1083. List Grades (25)-简单的排序

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn=10005;

struct Stu{
    char name[15];
    char id[15];
    int grade;
    bool operator<(const Stu tmp)const{
        return grade>tmp.grade;
    }
}stu[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%s %s %d",stu[i].name,stu[i].id,&stu[i].grade);
    }
    sort(stu,stu+n);
    int left,right;
    scanf("%d %d",&left,&right);
    int cnt=0;
    for(int i=0;i<n;i++){
        if(left<=stu[i].grade && stu[i].grade<=right){
            printf("%s %s\n",stu[i].name,stu[i].id);
            cnt++;
        }
    }
    if(cnt==0){
        printf("NONE\n");
    }
    return 0;
}