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. 输入描述: Each input file contains one test case. Each case is given in the following format:Nname[1] ID[1] grade[1]name[2] ID[2] grade[2]... ...name[N] ID[N] grade[N]grade1 grade2where 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. 输出描述: 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. 输入例子: 4 Tom CS000001 59 Joe Math990112 89 Mike CS991301 100 Mary EE990830 95 60 100 输出例子: Mike CS991301 Mary EE990830 Joe Math990112
#include
#include
#include
#include
using namespace std;
typedef struct
{
string name,Id;int grade;
}stu;
stu s[101];
bool cmp(stu a,stu b)
{
return a.grade>b.grade;
}
int main()
{
int n,i,a,b,flag;
while(cin>>n)
{
flag=1;
for(i=0;i
sort(s,s+n,cmp);cin>>a>>b;
for(i=0;i if(s[i].grade>=a&&s[i].grade<=b) { flag=0;cout< } if(flag) cout<<"NONE"< } return 0; } //结构体排序，水过。
