-
热度指数:3253
时间限制:C/C++ 1秒,其他语言2秒
空间限制:C/C++ 64M,其他语言128M
-
算法知识视频讲解
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:
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.
输出描述:
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.
示例1
输入
4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100
输出
Mike CS991301
Mary EE990830
Joe Math990112
把每个学生的信息保存到Student对象中,并把该对象加入链表中,最后对链表排序,遍历链表并调用print方法即可。另外,还要注意如果没有满足条件的学生,输出NONE。
完整代码如下