PAT甲级 1083

题目 List Grades

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.

解析

从输入的学生中找到成绩在grade1和grade2中的学生，并按降序输出

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

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

int n, min_grade, max_grade;
vector<student> students;
vector<student> res;

bool cmp(student s1, student s2) {
    return s1.grade > s2.grade;
}

void pat1083() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        student s;
        cin >> s.name >> s.id >> s.grade;
        students.push_back(s);
    }

    cin >> min_grade >> max_grade;
    for (int i = 0; i < n; ++i) {
        if (students[i].grade >= min_grade && students[i].grade <= max_grade) {
            res.push_back(students[i]);
        }
    }

    if (res.size() == 0) {
        cout << "NONE" << endl;
    } else {
        sort(res.begin(), res.end(), cmp);
        for (int i = 0; i < res.size(); ++i) {
            cout << res[i].name << " " << res[i].id << endl;
        }
    }

}


int main() {
    pat1083();
    return 0;
}