80求助

#include<iostream>
#include<algorithm>
using namespace std;
struct stu{
	int num,yw,sx,yy,zf;
}a[302];
int cmp(stu a,stu b)
{
	return (a.zf>b.zf)||(a.zf==b.zf&&a.yw>b.yw)||(a.zf==b.zf&&a.yw&&b.yw&&a.num<b.num);
}
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i].yw>>a[i].sx>>a[i].yy;
		a[i].num=i+1;
		a[i].zf=a[i].yw+a[i].sx+a[i].yy; 
	}
	sort(a,a+n,cmp);
	for(int i=0;i<5;i++)
	    cout<<a[i].num<<" "<<a[i].zf<<endl;
	return 0;
}