PAT甲级1083 List Grades (25 分)

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

      题目大意：

         给出n个人的记录，记录包括了姓名，id 以及成绩，最后一行给出一个成绩区间。求在此区间内，按成绩从大到小的输出相应的名字和id。

 

思路：

         一般而言，这种排序题都是创造结点存储信息，然后设计排序算法。

         而且一般来说区内排序是很不好处理的。但是此题很特殊，他保证了所有成绩都是不同的，这完全可以用数组下标存储成绩，数组内容存储名字和id，完全省去了排序的功夫。

 

参考代码：

 

#include<vector>
#include<iostream>
#include<string>
using namespace std;
struct node{
	string  name, id;
};
vector<node> list(101);
int grade1, grade2, n;
int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; ++i){
		int temp;
		string s1, s2;
		cin >> s1 >> s2 >> temp;
		list[temp].name = s1 + " ", list[temp].id = s2; 
	}
	scanf("%d%d", &grade1, &grade2);
	bool pt = false;
	for(int i = grade2; i >= grade1; --i)
		if(list[i].name.size()){
			pt = true;
			cout << list[i].name << list[i].id << endl;
		}
	if(!pt)	printf("NONE");
	return 0;
}