20分求调
查看原帖
20分求调
572727
封禁用户楼主2023/1/29 21:11
只对了第1个和第10个样例
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=110;
struct st
{
	string name;
	string occupation;
	ll banggong;
	ll grade;
};
ll n;
st a[N];
ll panduan(st x)
{
	if(x.occupation=="BangZhong")
	{
		return 0;
	}
	if(x.occupation=="JingYing")
	{
		return 1;
	}
	if(x.occupation=="TangZhu")
	{
		return 2;
	}
	if(x.occupation=="ZhangLao")
	{
		return 3;
	}
	if(x.occupation=="HuFa")
	{
		return 4;
	}
	if(x.occupation=="FuBangZhu")
	{
		return 5;
	}
	return 6;
}
bool cmp1(st x,st y)
{
	return x.banggong>y.banggong;
}
bool cmp2(st x,st y)
{
	if(panduan(x)==panduan(y))
	{
		return x.grade>y.grade;
	}
	return panduan(x)>panduan(y);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].occupation>>a[i].banggong>>a[i].grade;
	}
	sort(a+4,a+n+1,cmp1);
	for(int i=4;i<=n;i++)
	{
		if(i<=5)
		{
			a[i].occupation="HuFa";
		}
		else if(i<=9)
		{
			a[i].occupation="ZhangLao";
		}
		else if(i<=16)
		{
			a[i].occupation="TangZhu";
		}
		else if(i<=41)
		{
			a[i].occupation="JingYing";
		}
		else
		{
			a[i].occupation="BangZhong";
		}
	}
	sort(a+1,a+n+1,cmp2);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].name<<" "<<a[i].occupation<<" "<<a[i].grade<<"\n";
	}
	return 0;
}
2023/1/29 21:11
加载中...