A1083 List Grades （25 分）

#include<cstdio>
#include<algorithm>
using namespace std;
struct student
{
	char name[15];
	char id[15];
	int grade;
}stu[100];
bool cmp(student a, student b)
{
	return a.grade > b.grade;
}
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);
	}
	int min, max;
	int count = 0;
	scanf("%d %d", &min, &max);
	sort(stu, stu + n, cmp);
	for (int i = 0; i < n; i++)
	{
		if (stu[i].grade >= min && stu[i].grade <= max)
		{
			printf("%s %s\n", stu[i].name, stu[i].id);
			count++;
		}
	}
	if (count == 0) printf("NONE\n");
	return 0;
}