怎么会1个未通过捏
#include<bits/stdc++.h>
using namespace std;
int n;
struct cjd{
int yw,sx,yy,zf,xh;
}p[10010];
bool cmp(cjd a,cjd b){
if(a.zf>b.zf) return 1;
if(a.zf<b.zf) return 0;
if(a.yw>b.yw) return 1;
if(a.yw>b.yw) return 0;
return 0;
}
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
scanf("%d%d%d",&p[i].yw,&p[i].sx,&p[i].yy);
p[i].zf = p[i].yw+p[i].sx+p[i].yy;
p[i].xh=i;
}
sort(p,p+n,cmp);
for(int i=0;i<5;i++){
cout << p[i].xh+1 << " " << p[i].zf << endl;
}
return 0;
}