PAT-A1083 List Grades

A1083 List Grades

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

结尾无空行

只要细心，本难题没有什么难度，个人感觉算是排序题里面简单的了。。。。

代码如下：

#include<cstdio>
#include<algorithm>
using namespace std;
struct STU{
	char name[15];
	char ID[20];
	int score;
}S[10010];
bool cmp(STU a,STU b){
	return a.score>b.score;
}
int main(){
	int m;
	scanf("%d",&m);
	for(int i=0;i<m;i++){
		scanf("%s %s %d",&S[i].name,&S[i].ID,&S[i].score);
	}
	sort(S,S+m,cmp);
	int g1,g2;
	bool flag=true;
	scanf("%d %d",&g1,&g2);
	for(int i=0;i<m;i++){
		if(S[i].score<=g2&&S[i].score>=g1){
			printf("%s %s\n",S[i].name,S[i].ID);
			flag=false;
		}
		
	}
	if(flag) printf("NONE");
	return 0;
}