求调一份非常容易调的代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
    register int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-') f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<3)+(x<<1)+(c^48); 
        c=getchar();
    }
    return x*f;
}
struct node
{
	int id,banggong,lv;
	string name,zhiwei;
}a[115]; 
int n;
bool cmp(node x,node y)
{
	if(x.banggong==y.banggong) return x.id<y.id;
	else return x.banggong>y.banggong;
}
int level(string x)
{
	if(x=="Hufa") return 0;
	if(x=="Zhanglao") return 1;
	if(x=="Tangzhu") return 2;
	if(x=="Jingying") return 3;
	return 4;
}
void bian()
{
	for(int i=4;i<=n;i++)
	{
		if(i==4 || i==5) a[i].zhiwei="Hufa";
		if(i>=6 && i<=9) a[i].zhiwei="Zhanglao";
		if(i>=10 && i<=16) a[i].zhiwei="Tangzhu";
		if(i>=17 && i<=41) a[i].zhiwei="Jingying";
		if(i>=41) a[i].zhiwei="Bangzhong"; 
	}
}
bool cmp2(node x,node y)
{
	if(level(x.zhiwei)==level(y.zhiwei))
		if(x.lv==y.lv) return x.id<y.id;
		else return x.lv>y.lv;
	else return level(x.zhiwei)<level(y.zhiwei);
}
signed main()
{
	cout<<a[0].name<<a[0].zhiwei;
	n=read();
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].zhiwei;
		a[i].banggong=read(),a[i].lv=read();
		a[i].id=i;
		if(i<=3) cout<<a[i].name<<' '<<a[i].zhiwei<<' '<<a[i].lv<<endl;
	}
	sort(a+4,a+n+1,cmp);
	bian();
    /*for(int i=4;i<=n;i++)
		cout<<a[i].name<<' '<<a[i].zhiwei<<' '<<a[i].lv<<endl;*/
	sort(a+4,a+n+1,cmp2);
	for(int i=4;i<=n;i++)
		cout<<a[i].name<<' '<<a[i].zhiwei<<' '<<a[i].lv<<endl;
	return 0;
}