PAT 1083. List Grades (25)(成绩排序)
来源:互联网 发布:检测图片中的文字算法 编辑:程序博客网 时间:2024/05/17 22:13
官网
1083. List Grades (25)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
题目大意
- 1.给你n个学生的名字,id和分数,要你按照分数非递减进行排序,并输出给定分数区间的那些记录。
- 2.保证所有分数都是不同的。
- 3.有就输出名字和id,没有就输出”NONE”。
解题思路
- 1.排序再输出就行了,再用一个bool值判断是否要输出”NONE”就行了。
AC代码
#include<iostream>#include<algorithm>#include<string>#include<vector>using namespace std;struct student{ string name, id; int grade;};bool cmp(const student &a, const student &b){ return a.grade > b.grade;}int n;int main(){ cin >> n; vector<student> stu(n); for (int i = 0; i < n; i++) { cin >> stu[i].name >> stu[i].id >> stu[i].grade; } int grade1, grade2; cin >> grade1 >> grade2; if (!stu.empty()) { sort(stu.begin(), stu.end(),cmp); bool flag = false; for (int i = 0; i < n; i++) { ; if (stu[i].grade<=grade2&&stu[i].grade>=grade1) { //判断是否要输出"NONE" if (!flag) { flag = true; } cout << stu[i].name << " " << stu[i].id << endl; } } if (!flag) { cout << "NONE" << endl; } } else { cout << "NONE" << endl; } return 0;}
- PAT 1083. List Grades (25)(成绩排序)
- PAT-A1083. List Grades (25)(排序)
- PAT(甲级)1083. List Grades (25)
- PAT 1083. List Grades (25)
- 1083. List Grades (25) PAT
- PAT 1083. List Grades(25)
- pat 1083. List Grades (25)
- PAT 1083. List Grades (25)
- 【PAT】1083. List Grades (25)
- 1083. List Grades (25) PAT
- PAT (Advanced Level) 1083. List Grades (25) 结构体排序
- 1083. List Grades (25)-排序(易)
- PAT 1083. List Grades
- 【PAT】1083. List Grades
- PAT--1083. List Grades
- PAT A 1083. List Grades (25)
- 【PAT (Advanced Level)】1083. List Grades (25)
- PAT (Advanced) 1083. List Grades (25)
- 怎么样防止Sql注入?
- mergeSort代码实现
- 用duplicate复制数据库
- J-LINK下载程序时的注意事项
- 队列求解网格中任意两点间最短路径
- PAT 1083. List Grades (25)(成绩排序)
- 微信小程序把玩(九)scroll-view组件
- tmux恢复窗口配置
- Java之继承
- 强制IE浏览器或WebBrowser控件使用指定版本显示网页
- okHttp使用教程
- 4-求并联电阻之和
- CSS常见问题积累
- Jquery学习总结(5)——jQuery选择器