【PTA] - 1083 List Grades (25分)

• 题目链接： https://pintia.cn/problem-sets/994805342720868352/problems/994805383929905152
• 知识点： 基本数据结构的使用
• 水题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <cmath>
using namespace std;
#define inf 0x3f3f3f3f

struct node
{
    char name[12];  // 空间多开
    char id[12];
    int grade;
};

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

int main(int argc, const char **argv)
{
    int n;
    cin >> n;
    vector<node> v(n);
    vector<node> v1;
    for (int i = 0; i < n; i++)
    {
        scanf("%s %s %d", v[i].name, v[i].id, &v[i].grade);
    }
    int grade1, grade2;
    cin >> grade1 >> grade2;
    int count = n;
    for (int i = 0; i < v.size(); i++)
    {
        if (v[i].grade >= grade1 && v[i].grade <= grade2)
        {
            v1.push_back(v[i]);
            count--;
        }
    }
    if (count == n)
    {
        cout << "NONE" << endl;
        return 0;
    }

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