a1083 list grades

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.

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.

4 
Tom CS000001 59 
Joe Math990112 89 
Mike CS991301 100 
Mary EE990830 95 
60 100 

Mike CS991301 
Mary EE990830 
Joe Math990112 

2 
Jean AA980920 60
Ann CS01 80 
90 95 

NONE

#include <bits/stdc++.h>
using namespace std;
const int max_n = 101;

struct Student
{
    char name[11];
    char id[11];
    int grade;
} student[max_n];

bool cmp(Student s1, Student s2)
{
    return s1.grade > s2.grade;
}

int main()
{
    int N, rangeL, rangeR;
    scanf("%d", &N);
    for (int i = 1; i <= N; i++)
        scanf("%s%s%d", student[i].name, student[i].id, &student[i].grade);
    scanf("%d%d", &rangeL, &rangeR);
    sort(student + 1, student + N + 1, cmp);

    bool flag = false;
    for (int i = 1; i <= N; i++)
        if (student[i].grade >= rangeL && student[i].grade <= rangeR)
        {
            printf("%s %sn", student[i].name, student[i].id);
            flag = true;
        }

    if (!flag)
        printf("NONEn");

    return 0;
}