【PAT】1083. List Grades (25)

最新推荐文章于 2021-12-04 10:16:58 发布

realxuejin

最新推荐文章于 2021-12-04 10:16:58 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT 文章标签： PAT 排序

本文链接：https://blog.youkuaiyun.com/realxuejin/article/details/49357221

PAT 专栏收录该内容

107 篇文章

订阅专栏

本文深入探讨了AI在音视频处理领域的应用，包括视频分割、语义识别、自动驾驶、AR、SLAM等先进技术，以及语音识别、变声、终端AI边缘计算等方面的发展趋势。

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

分析：简单的结构体排序问题。

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

struct node{
	string name;
	string id;
	int grade;
};

bool cmp(node a, node b){
	return a.grade < b.grade;
}

int main(int argc, char** argv) {
	int n, i;
	scanf("%d",&n);
	vector<node> stus(n);
	for(i=0; i<n; i++){
		cin>>stus[i].name>>stus[i].id>>stus[i].grade;
	}
	
	sort(stus.begin(), stus.end(), cmp);
	
	int max, min;
	scanf("%d %d",&min, &max);
	if(stus[0].grade>max || stus[n-1].grade<min) {
		printf("NONE\n");
		return 0;
	}
	
	int begin=-1, end=-1;
	for(i=0; i<n; i++){
		if(stus[i].grade>=min && begin==-1){
			begin=i;
		}
		if(stus[i].grade<=max){
			end=i;
		}else{
			break;
		}
	}
    for(i=end; i>=begin; i--){
    	cout<<stus[i].name<<" "<<stus[i].id<<endl;
	}
	
	return 0;
}