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 100Sample Output 1:
Mike CS991301 Mary EE990830 Joe Math990112Sample Input 2:
2 Jean AA980920 60 Ann CS01 80 90 95Sample Output 2:
NONE
简单的排序问题。学生信息有姓名,学号和成绩,每个学生的成绩都是唯一的。然后按成绩从大到小排序,最后按顺序输出成绩在给定范围内的学生的姓名和学号,如果在给定范围内没有符合的学生,则输出“NONE“。
代码:
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct student
{
string name;
string id;
int grade;
};
bool cmp(const student &s1,const student &s2)
{
return s1.grade>s2.grade;
}
int main()
{
int n;
cin>>n;
vector<student>students(n);
for(int i=0;i<n;i++)
{
cin>>students[i].name>>students[i].id>>students[i].grade;
}
int high,low;
cin>>low>>high;
sort(students.begin(),students.end(),cmp);
bool isnone=true;
for(int i=0;i<n;i++)
{
if(students[i].grade>high) continue;
else if(students[i].grade<low) break;
cout<<students[i].name<<" "<<students[i].id<<endl;
isnone=false;
}
if(isnone) cout<<"NONE"<<endl;
}