1083 List Grades (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:400 ms
内存限制:64 MB
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
题意:
输出规定区间内的学生,按成绩从高到低顺序。
思路:
将不满足区间的学生成绩置为-1,统计满足区间的人数,按人数输出。
参考代码:
#include <iostream>
#include <algorithm>
using namespace std;
struct student {
char name[11], id[11];
int grade;
};
bool cmp(student a, student b) {
return a.grade > b.grade;
}
int main() {
int n, grade1, grade2, cnt = 0;
scanf("%d", &n);
student stu[n];
for (int i = 0; i < n; i++)
scanf("%s %s %d", stu[i].name, stu[i].id, &stu[i].grade);
scanf("%d%d", &grade1, &grade2);
for (int i = 0; i < n; i++)
if (stu[i].grade >= grade1 && stu[i].grade <= grade2)
cnt++;
else stu[i].grade = -1;
sort(stu, stu + n, cmp);
for (int i = 0; i < cnt; i++)
printf("%s %s\n", stu[i].name, stu[i].id);
if (cnt == 0)printf("NONE");
return 0;
}
如有错误,欢迎指正