没分蒟蒻求助
查看原帖
没分蒟蒻求助
1041253
aungm楼主2023/11/19 14:27
#include<bits/stdc++.h>
using namespace std;

int n;

struct  qqq
{
	int y,s,e,z,id;
}a[303];

bool cmp(qqq x,qqq y)
{
	if(x.z!=y.z)
		return x.z>y.z;
	else if (x.y!=y.y)
		return x.y>y.y;
	else
		return x.id<y.id;
		
}

int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].y>>a[i].s>>a[i].e;
		a[i].id=i;
		a[i].z=a[i].y+a[i].s+a[i].e;
	}
	sort(a+1,a+n,cmp);
	for(int i=1;i<=5;i++)
	{
		cout<<a[i].id<<' '<<a[i].z<<"\n";
	}
}

2023/11/19 14:27
加载中...