1083. List Grades (25)

#include <iostream>

using namespace std;

struct node
{
	char name[20], id[20];
}stu[110];

int flag[110];

int main()
{
	int n;
	scanf("%d", &n);

	int i, grade;
	node nod;

	for(i = 1; i <= n; i++)
	{
		getchar();
		scanf("%s%s%d", nod.name, nod.id, &grade);

		flag[grade] = 1;
		stu[grade] = nod;
	}

	int min, max;
	scanf("%d%d", &min, &max);

	int res = 0;
	for(i = max; i >= min; i--)
	{
		if(flag[i] == 1)
		{
			res = 1;
			printf("%s %s\n", stu[i].name, stu[i].id);
		}
	}

	if(res == 0)
	{
		printf("NONE\n");
	}

	system("pause");
	return 0;
}

 

posted on 2025-11-23 17:19  王景迁  阅读(0)  评论(0)    收藏  举报

导航