浙江大学PAT_甲级_1083. 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
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.

Output Specification:

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.

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

我的C++代码：

#include<iostream>
#include<algorithm>
#include<string>
#include<array>
using namespace std;
int main()
{
	int i = 0, n = 0;//n学生人数
	int grade=0,mingrade = 0, maxgrade = 0;//mingrade最低分数线，maxgrade最高分数
	string name, ID;
	array<string,101> NameAndID;//数组以分数为下标用来存储姓名和ID
	NameAndID.fill("#");//姓名和ID全部设置为"#"
	cin >> n;
	for (i = 0; i < n; i++)
	{
		cin >>name >> ID >> grade;
		NameAndID[grade] = name + ' ' + ID;
	}
	cin >> mingrade >> maxgrade;
	for (i =maxgrade; i >=mingrade; i--)//从最高分到最低分输出姓名和ID
	{
		if (NameAndID[i] != "#")
		{
			cout << NameAndID[i] << endl;
			n = -1;
		}
	}
	if (n!=-1)//没有符合条件的人
	{
		cout << "NONE";
	}
	//system("pause");
	return 0;
}