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.

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 <bits/stdc++.h>
using namespace std;

struct Student{
    char name[12], id[12];
    int grade;
};

vector<Student> vec;
int n;

int main(){

    scanf("%d", &n);
    vec.resize(n);

    for(int i = 0; i < n; ++i){
        scanf("%s %s %d", vec[i].name, vec[i].id, &vec[i].grade);
    }

    int grade1, grade2;
    scanf("%d %d", &grade1, &grade2);
    int cnt = 0;
    for(auto it = vec.begin(); it != vec.end(); ++it){
        if(it->grade < grade1 || it->grade > grade2) it->grade = -1, cnt++;
    }

    sort(vec.begin(), vec.end(), [](Student s1, Student s2){ return s1.grade > s2.grade; });

    if(vec.size() == cnt) cout << "NONE" << endl;
    else{
        for(int i = 0; i < vec.size() - cnt; ++i) cout << vec[i].name << " " << vec[i].id << endl;
    }

    return 0;
}