结构体排序做的

#include<bits/stdc++.h>
using namespace std;

struct nod
{
	int num,chn,mth,eng,sum;
} a[310];

bool cmp(nod n1,nod n2)
{
	if(n1.sum==n2.sum)
	{
		if(n1.chn==n2.sum)
		{
			return n1.num<n2.num;
		}
		return n1.chn>n2.chn;
	}
	return n1.sum>n2.sum;
} 

int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&a[i].chn,&a[i].mth,&a[i].eng);
		a[i].num=i;
		a[i].sum=a[i].chn+a[i].mth+a[i].eng;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=min(5,n);i++)
	{
		cout<<a[i].num<<" "<<a[i].sum<<"\n";
	}
	return 0;
}