#include <bits/stdc++.h>
using namespace std;
struct student
{
int id;
int yu,shu,yin;
int sum;
}a[305];
bool cmp(student x,student y)
{
if(x.sum>y.sum) return 1;
else if(x.sum<y.sum) return 0;
else
{
if(x.yu>y.yu) return 1;
else if(x.yu<y.yu) return 0;
else
{
if(x.id>y.id) return 1;
else
return 0;
}
}
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
a[i].id=i;
cin>>a[i].yu>>a[i].shu>>a[i].yin;
a[i].sum=a[i].yu+a[i].shu+a[i].yin;
}
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
{
cout<<a[i].id<<" "<<a[i].sum<<endl;
}
return 0;
}
成绩排序——结构体排序
最新推荐文章于 2023-11-22 02:45:00 发布