60分，求条

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
string x[8]={"","BangZhu","FuBangZhu","HuFa","ZhangLao","TangZhu","JingYing","BangZhong"};
struct bangyou
{
    string n,x;
    int l,g;
}a[110];
bool cmp1(bangyou a,bangyou b)
{
    if(a.g>=b.g) return 0;
    return 1;
}
bool cmp2(bangyou a,bangyou b)
{
    if(a.x==b.x)
    {
        if(a.l>=b.l) return 0;
        return 1;
    }
    return 0;
}
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>a[i].n>>a[i].x>>a[i].g>>a[i].l;
    for(int i=4;i<=n-1;++i)
    {
        for(int j=n-1;j>=i;--j)
        {
            if(cmp1(a[j],a[j+1])==1)
                swap(a[j],a[j+1]);
        }
    }
    for(int i=4;i<=n;++i)
    {
        if(i<=5)
        {
            a[i].x=x[3];
            continue;
        }
        if(i<=9)
        {
            a[i].x=x[4];
            continue;
        }
        if(i<=16)
        {
            a[i].x=x[5];
            continue;
        }
        if(i<=41)
        {
            a[i].x=x[6];
            continue;
        }
        a[i].x=x[7];
    }
    for(int i=4;i<=n-1;++i)
    {
        for(int j=n-1;j>=i;--j)
        {
            if(cmp2(a[j],a[j+1])==1)
                swap(a[j],a[j+1]);
        }
    }
    for(int i=1;i<=n;++i)
        cout<<a[i].n<<" "<<a[i].x<<" "<<a[i].l<<endl;
    return 0;
}