实在看不出来QwQ

#include<bits/stdc++.h>
using namespace std;
struct node {
    string name, job;
    int tribute, level;
}a[120];
vector<node> b, c;
int n;
int cmp(node x, node y) {
    return x.tribute > y.tribute;
}
int cmp1(node x, node y) {
    return (x.job == "BangZhu" && y.job == "FuBangZhu");
}
int cmp2(node x, node y) {
    if (x.job == y.job) {
        return x.level > y.level;
    }
    return ((x.job == "BangZhu" && y.job == "FuBangZhu") || (x.job == "FuBangZhu" && y.job == "Hufa") || (x.job == "HuFa" && y.job == "ZhangLao") || (x.job == "ZhangLao" && y.job == "TangZhu") || (x.job == "TangZhu" && y.job == "JingYing") || (x.job == "JingYing" && y.job == "BangZhong"));
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].name >> a[i].job >> a[i].tribute >> a[i].level;
        if (a[i].job != "BangZhu" && a[i].job != "FuBangZhu") {
            b.push_back(a[i]);
        } else {
            c.push_back(a[i]);
        }
    }
    sort(c.begin(), c.end(), cmp1);
    sort(b.begin(), b.end(), cmp);
    for (int i = 0; i < b.size(); i++) {
        if (i + 1 <= 2) {
            b[i].job = "HuFa";
        } else if (i + 1 <= 6) {
            b[i].job = "ZhangLao";
        } else if (i + 1 <= 13) {
            b[i].job = "TangZhu";
        } else if (i + 1 <= 38) {
            b[i].job = "JingYing";
        } else {
            b[i].job = "BangZhong";
        }
    }
    b.insert(b.begin(), *(--c.end())); c.pop_back();
    b.insert(b.begin(), *(--c.end())); c.pop_back();
    b.insert(b.begin(), *(--c.end()));
    sort(b.begin(), b.end(), cmp2);
    for (int i = 0; i < n; i++) {
        cout << b[i].name << " " << b[i].job << " " << b[i].level << endl;
    }
    return 0;
}

请不要给我一段代码！（因为我看不懂）