代码
#include<bits/stdc++.h>
using namespace std;
struct csxs
{
int id,a,b,c,d,e;
double cj;
}a[125];
int cmp(csxs a,csxs b)
{
if(a.cj!=b.cj) return a.cj>b.cj;
else return a.id<b.id;
}
int main()
{
int n,maxn,minx,i;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i].id>>a[i].a>>a[i].b>>a[i].c>>a[i].d>>a[i].e;
a[i].cj=a[i].a+a[i].b+a[i].c+a[i].d+a[i].e;
maxn=max(a[i].a,max(a[i].b,max(a[i].c,max(a[i].d,a[i].e))));
minx=min(a[i].a,min(a[i].b,min(a[i].c,min(a[i].d,a[i].e))));
a[i].cj=a[i].cj-maxn-minx;
a[i].cj/=3.000;
}
sort(a,a+n,cmp);
for(int i=0;i<3;i++)
{
cout<<a[i].id<<' ';
cout<<fixed<<setprecision(3)<<a[i].cj<<endl;
}
return 0;
}
记得点赞+关注+收藏!!!谢谢!!!