【PAT】A1083 List Grades

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

_之桐_

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

阅读量132

点赞数

CC 4.0 BY-SA版权

分类专栏： —— AC笔记 —— 文章标签： PTA

本文链接：https://blog.csdn.net/xt199711/article/details/97913526

—— AC笔记 —— 专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一种算法，用于按指定成绩区间对学生的记录进行非递增排序。输入包括学生姓名、ID和成绩，输出为成绩在给定区间的记录，按成绩从高到低排序。如果区间内无记录，则输出'NONE'。

摘要生成于 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

解题思路：

理解题意：给出一组数据和一个分数段，找出在这个分数段中同学的姓名和学号
代码分4段：首先是输入数据；其次，对数据使用sort()函数进行排序；然后，记录第一个小于max的数的下标和最后一个大于min的数的下标；最后，输出这段下标中的同学的姓名和学号。
总结：本题是排序类型题目中十分常规的题目，模式也是“输入-排序-处理-输出”。其中值得注意的是height的值是小于low的值的，这点在编写代码的时候要注意

代码：

#include <stdio.h>
#include <algorithm>
using namespace std;
struct stu{
	char name[11],id[11];
	int grade;
}s[100010];

bool cmp(stu a,stu b){
	return a.grade>b.grade; 
}

int main(){
	int n,gmin,gmax,flag=0,low=-1,height=-1;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%s%s%d",s[i].name,s[i].id,&s[i].grade);
	}
	sort(s,s+n,cmp);
	scanf("%d%d",&gmin,&gmax);
	for(int i=0;i<n;i++){
		if(s[i].grade<=gmax&&s[i].grade>=gmin) {
			height=i;
			break;
		}
	}
	for(int i=0;i<n;i++){
		if(s[i].grade<=gmax&&s[i].grade>=gmin) 
			low=i;
	}
	for(int i=height;i<=low;i++){
		if(low==-1&&height==-1) printf("NONE");
		else printf("%s %s\n",s[i].name,s[i].id);
	}
	return 0;
}