1083 List Grades

题目来源：PAT (Advanced Level) Practice

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

words：

interval 间隔，区间        boundaries 边界，范围

思路：

1. 使用结构体数组将 n 个记录保存起来，然后使用 sort（）函数按照grade以非增序方式排序；

2. 判断排序后数组的每一个元素的成绩是否在区间[grade1,grade2]内，若在则输出；

3. 若没有一个元素在上述区间内，则输出“NONE”；

//PAT ad 1083 List Grades
#include <iostream>
using namespace std;
#include <algorithm>

struct student
{
	string name;
	string id;
	int grade;
};


bool cmp(student x,student y)
{
	return x.grade>y.grade;		//non-increasing order
}

int main()
{
	int n,i,grade1,grade2;
	cin>>n;
	student p[n]; 
	
	for(i=0;i<n;i++)		//输入 
		cin>>p[i].name>>p[i].id>>p[i].grade;
	cin>>grade1>>grade2;
	
	sort(p,p+n,cmp);	//排序 
	bool flag=false;	//代表是否有学生的成绩在[grade1,grade2]内 
	for(i=0;i<n;i++)	//输出grade1和grade2范围内且排好序的学生name和ID 
		if(p[i].grade>=grade1&&p[i].grade<=grade2)
		{
			cout<<p[i].name<<" "<<p[i].id<<endl;
			flag=true;
		}
	if(!flag)	cout<<"NONE"<<endl;		//	there is no student's grade in that interval
	
	
	return 0;
 }