Pat 1083 list grades (25 points)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct stu{
    
    char name[11],ID[11];
    int grade;
};
bool cmp(stu a,stu b){
    
    return a.grade>b.grade;    // Because every student ⽣ Their grades are different , So you can arrange them in descending order ,return a.grade > b.grade
}
int main() {
    
    int n,low,high,cnt=0;
    cin>>n;
    vector<stu>a(n);
    for(int i=0;i<n;i++)
        scanf("%s %s %d",&a[i].name,&a[i].ID,&a[i].grade);        //cin>>a[i].name>>a[i].ID>>a[i].grade;
    scanf("%d %d",&low,&high);
    sort(a.begin(),a.end(),cmp);
    for(int i=0;i<a.size();i++){
    
        if(a[i].grade<=high&&a[i].grade>=low){
    
            printf("%s %s\n",a[i].name,a[i].ID);
            cnt++;                        // Number of qualified students 
        }else if(a[i].grade<low) break;
    }
    if(cnt==0) printf("NONE");
    return 0;
}