pat 乙级 1015. 德才论(25)

最新推荐文章于 2023-09-22 22:18:12 发布

PasserbyQk

最新推荐文章于 2023-09-22 22:18:12 发布

阅读量251

点赞数

分类专栏： PAT乙级题解

本文链接：https://blog.csdn.net/qikai121521/article/details/77836760

版权

PAT乙级题解专栏收录该内容

72 篇文章 0 订阅

订阅专栏

注意：用cout cin 这道题容易超时建议用scanf printf

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
struct node {
    int num;
    int de;
    int cai;
};
int cmp(struct node a, struct node b) {
    if ((a.de + a.cai) != (b.de + b.cai)) {
        return (a.de + a.cai) > (b.de + b.cai);
    }else if (a.de != b.de) {
        return a.de > b.de;
    } else
        return a.num < b.num;
}
int main() {
    int n, low, high;
    scanf("%d %d %d", &n, &low, &high);
    vector<node> a, b, c, d;
    node temp;
    int total = n;
    for (int i = 0; i < n; i++) {
        scanf("%d %d %d", &temp.num, &temp.de, &temp.cai);
        if (temp.de < low || temp.cai < low) {
            total--;
            continue;
        }
        if (temp.de >= high && temp.cai >= high) {
            a.push_back(temp);
        } else if (temp.de >= high && temp.cai < high) {
            b.push_back(temp);
        } else if (temp.de < high && temp.cai < high && temp.de >= temp.cai) {
            c.push_back(temp);
        } else {
            d.push_back(temp);
        }
    }
    sort(a.begin(), a.end(), cmp);
    sort(b.begin(), b.end(), cmp);
    sort(c.begin(), c.end(), cmp);
    sort(d.begin(), d.end(), cmp);
    printf("%d\n", total);
    for(int i = 0; i < a.size(); i++)
        printf("%d %d %d\n", a[i].num, a[i].de, a[i].cai);
    for(int i = 0; i < b.size(); i++)
        printf("%d %d %d\n", b[i].num, b[i].de, b[i].cai);
    for(int i = 0; i < c.size(); i++)
        printf("%d %d %d\n", c[i].num, c[i].de, c[i].cai);
    for(int i = 0; i < d.size(); i++)
        printf("%d %d %d\n", d[i].num, d[i].de, d[i].cai);
    return 0;
}