总是少输出1个求调
查看原帖
总是少输出1个求调
1497481
wenyuhao120806楼主2025/1/12 16:47

#include <bits/stdc++.h>

using namespace std;

struct stu{

int yu,shu,ying,zf,id

; }a[302];

#include <bits/stdc++.h>
using namespace std;
struct stu{
	int yu,shu,ying,zf,id;
	}a[302];
int cmp(stu a,stu b){
	if(a.zf!=b.zf){
		return a.zf>b.zf; 
	}else if(a.yu!=b.yu){
	    return a.yu>b.yu;
	}else{
		return a.id<b.id;
	}
} 
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
		cin>>a[i].yu>>a[i].shu>>a[i].ying;
		a[i].zf=a[i].yu+a[i].shu+a[i].ying;
		a[i].id=i;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<5;i++){
		cout<<a[i].id<<' '<<a[i].zf<<endl;
    }
	return 0;
}

int cmp(stu a,stu b){

if(a.zf!=b.zf){

	return a.zf>b.zf; 

}else if(a.yu!=b.yu){

    return a.yu>b.yu;
  
}else{

	return a.id<b.id;

}

} int main(){

int n;
cin>>n;
for(int i=1;i<=n;i++){
	cin>>a[i].yu>>a[i].shu>>a[i].ying;
	a[i].zf=a[i].yu+a[i].shu+a[i].ying;
	a[i].id=i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<5;i++){
	cout<<a[i].id<<' '<<a[i].zf<<endl;
}
return 0;

}

2025/1/12 16:47
加载中...