# A1083 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
... ...


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 [grade1grade2] 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

### 注意：

1. 题中N 的大小并未给定，测试可知N 未超过50，最大值设为50即可
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 50;
struct Student{
char name[11];
char id[11];
}stu[maxn];
bool cmp(Student a, Student b){
}

int main(){
int n, left, right;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%s %s %d", stu[i].name, stu[i].id, &stu[i].grade);
}
scanf("%d %d", &left, &right);
sort(stu, stu + n, cmp);
bool flag = false;
for(int i = 0; i < n; i++){
}