P1786 帮贡排序

听风客1

于 2024-09-30 13:58:48 发布

阅读量103

点赞数 1

分类专栏：洛谷刷题cpp 文章标签：算法模拟 c++

本文链接：https://blog.csdn.net/2401_83010439/article/details/142655348

版权

洛谷刷题cpp 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

struct person
{
    string name,prepostion,nowposition;
    long long contribution;
    int level,rank;
}a[115];

int change(string s)
{
    if (s == "BangZhu") return 0;
    if (s == "FuBangZhu") return 1;
    if (s == "HuFa") return 2;
    if (s == "ZhangLao") return 3;
    if (s == "TangZhu") return 4;
    if (s == "JingYing") return 5;
    if (s == "BangZhong") return 6;
}

int compare1(person o1, person o2)
{
    if(o1.contribution == o2.contribution)
    {
        return o1.rank<o2.rank;//排名越小越靠前
    }else
    {
        return o1.contribution>o2.contribution;//贡献越多越靠前
    }
}

int compare2(person o1, person o2)
{
    if(change(o1.nowposition) == change(o2.nowposition))
    {
        if(o1.level == o2.level)
        {
            return o1.rank < o2.rank;
        }else
        {
            return o1.level > o2.level;
        }
    }else
    {
        return change(o1.nowposition) < change(o2.nowposition);
    }
}

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n;
    cin >> n;

    for(int i = 1; i <=  n; i++)
    {
        cin >> a[i].name >> a[i].prepostion >> a[i].contribution >> a[i].level;
        a[i].rank = i;
    }

    sort(a + 4, a+ 1+ n, compare1);

    for (int i = 1; i <= n; i++){
        if (i == 1) a[i].nowposition = "BangZhu";
        else if (i == 2 || i == 3) a[i].nowposition = "FuBangZhu";
        else if (i == 4 || i == 5) a[i].nowposition = "HuFa";
        else if (i >= 6 && i <= 9) a[i].nowposition = "ZhangLao";
        else if (i >= 10 && i <= 16) a[i].nowposition = "TangZhu";
        else if (i >= 17 && i <= 41) a[i].nowposition = "JingYing";
        else a[i].nowposition = "BangZhong";
    }

    sort(a + 1, a +1 + n, compare2);

    for(int i = 1; i <= n; i++)
    {
        cout << a[i].name << " " << a[i].nowposition << " " << a[i].level << endl;
    }
    return 0;
}