PAT甲级 A1083
题目详情
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
解题思路
最简单的排序题,直接调用sort即可
以下为AC代码
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
#include<iomanip>
#include<queue>
#include<cmath>
using namespace std;
class students {
public:
string name;
int grade;
string nos;
};
vector<students> sts;
vector<students> ans;
bool cmp(students a, students b) {
return a.grade > b.grade;
}
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++) {
students temp;
cin >> temp.name >> temp.nos >> temp.grade;
sts.push_back(temp);
}
int g1; int g2; cin >> g1 >> g2;
for (int i = 0; i < sts.size(); i++) {
if (sts[i].grade >= g1 && sts[i].grade <= g2) {
ans.push_back(sts[i]);
}
}
sort(ans.begin(), ans.end(), cmp);
for (int i = 0; i < ans.size(); i++) {
cout << ans[i].name << " " << ans[i].nos << '\n';
}
if (ans.size() == 0) {
cout << "NONE" << '\n';
}
}