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
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N;
struct Record
{
char name[12];
char ID[12];
int scores;
};
vector<Record> vec;
bool cmpGrade (const Record &stue1, const Record &stu2) {
return stu2.scores < stue1.scores;
}
int print(int istart, int iend) {
int cnt = 0;
for (int i = 0; i < N; ++i)
{
if(vec[i].scores >= istart && vec[i].scores <= iend) {
cnt++;
printf("%s %s\n", vec[i].name, vec[i].ID);
}
}
return cnt;
}
int main() {
cin >> N;
Record record;
char name[12], ID[12];
int scores, istart, iend;
for (int i = 0; i < N; ++i)
{
scanf("%s %s %d", name, ID, &scores);
strcpy(record.name, name);
strcpy(record.ID, ID);
record.scores = scores;
vec.push_back(record);
}
scanf("%d %d", &istart, &iend);
sort(vec.begin(), vec.end(), cmpGrade);
int ans = print(istart, iend);
if(ans == 0) printf("NONE\n");
return 0;
}
本文介绍了一种算法,该算法能够读取一系列学生记录(包括姓名、ID和成绩),并根据给定的成绩区间筛选和排序这些记录。最终输出成绩位于指定区间内学生的姓名和ID,并按成绩降序排列。
441

被折叠的 条评论
为什么被折叠?



