PAT.a1083. List Grades

最新推荐文章于 2024-09-21 22:17:32 发布

原创最新推荐文章于 2024-09-21 22:17:32 发布 · 124 阅读

0 ·

CC 4.0 BY-SA版权

针对PAT竞赛中的学生记录，此程序实现了一种排序算法，能够根据学生的成绩进行非递增排序，并筛选出指定成绩区间内的学生信息。输入包括学生姓名、ID及成绩，输出为成绩在指定范围内的学生姓名与ID。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

大水题，对PAT质量产生怀疑，大水题太多了点。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
struct Person {
	char name[11], id[11];
	int grade;
}stu[50];
bool cmp(Person a, Person b) {
	return a.grade > b.grade;
}

int main(){
	int n,f=0;
	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 l, r;
	scanf("%d%d", &l, &r);
	for (int i = 0; i < n; i++) {
		if (stu[i].grade >= l&&stu[i].grade <= r) {
			printf("%s %s\n", stu[i].name, stu[i].id);
			f = 1;
		}
	}
	if (!f) printf("NONE");
	return 0;
}