1083 List Grades (25 分)

版权声明:转载留名即可 ^_^ https://blog.csdn.net/qq_33375598/article/details/87990235


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:

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 [grade1grade2] 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:

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:

Jean AA980920 60
Ann CS01 80
90 95

Sample Output 2:



using namespace std;
const int maxn = 100;
struct Student
  char name[15];
  char id[15];
  int grade;

bool cmp(Student a, Student b){
  return a.grade > b.grade;
int main(int argc, char const *argv[])
  int N;
  scanf("%d", &N);
  for (int i = 0; i < N; ++i)
    scanf("%s%s%d", stu[i].name, stu[i].id, &stu[i].grade);

  sort(stu, stu + N, cmp);
  int garde1, grade2;
  scanf("%d%d", &garde1, &grade2);
  bool flag = false;
  for (int i = 0; i < N; ++i)
    if(stu[i].grade >= garde1 && stu[i].grade <= grade2){
      printf("%s %s\n",stu[i].name, stu[i].id);
      flag = true;
  if(flag == false){
  return 0;