PAT A1083

最新推荐文章于 2023-03-15 22:45:58 发布

52Tiramisu

最新推荐文章于 2023-03-15 22:45:58 发布

阅读量147

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/gsj9086/article/details/86470491

版权

PAT 专栏收录该内容

80 篇文章 11 订阅

订阅专栏

1083 List Grades （25 分）

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

代码：

#include <cstdio>
#include <algorithm>
using namespace std;
struct Student{
	char name[15];
	char id[15];
	int grade;
}stu[100];
bool cmp(Student a, Student b){
	return a.grade > b.grade;
}
int main(){
	int n, grade1, grade2;
	scanf("%d", &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);
	int m = n;
	for(int i = 0; i < n; i++){
		if(stu[i].grade > grade2 || stu[i].grade < grade1)
			m--;			
	}
	sort(stu, stu+n, cmp);
	if(m == 0){
		printf("NONE\n");
	}else{
		for(int i = 0; i < n; i++){	
			if(stu[i].grade > grade2 || stu[i].grade < grade1){
				continue;
			}
			else
				printf("%s %s %d\n", stu[i].name, stu[i].id, stu[i].grade);
		}
	}
	return 0;
}

不知为何，只有一个测试点通过。其余答案错误。

正确代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Student{
	char name[11];
	char id[11];
	int grade;
}stu[50];
bool cmp(Student a, Student b){
	return a.grade > b.grade;
}
int main(){
	int n, left, right;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%s %s %d", stu[i].name, stu[i].id, &stu[i].grade);
	}
	scanf("%d%d", &left, &right);
	sort(stu, stu + n, cmp);
	bool flag = false;
	for(int i = 0; i < n; i++){
		if(stu[i].grade >= left && stu[i].grade <= right){
			printf("%s %s\n", stu[i].name, stu[i].id);
			flag = true;
		}
	}
	if(flag == false)
		printf("NONE\n");
	return 0;
}

设置flag，