互评成绩

题目详情 - L2-015 互评成绩 (25 分) (pintia.cn)

结构体排序：

#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
double a[N];
bool cmp(double x,double y)
{
    return x<y;
}
int main(){
    int n,m,q,k=1;
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)
    {
        int minn=100000,maxn=-1;
        double sum=0;
        for(int j=1;j<=m;j++)
        {
            int x;
            cin>>x;
            sum+=x;
            maxn=max(maxn,x);
            minn=min(minn,x);
        }
        sum-=minn;
        sum-=maxn;
        //cout<<sum<<endl;
        double X=sum/(m-2);
        //cout<<X<<endl;
        a[i]=X;
    }
    //for(int i=1;i<=q;i++) cout<<a[i]<<" ";
    sort(a+1,a+n+1,cmp);
    for(int i=n-q+1;i<=n-1;i++) printf("%.3lf ",a[i]);
    printf("%.3lf",a[n]);
    return 0;
}