代码:
#include<iostream>
#include<algorithm>
#include <iomanip>
using namespace std;
//数组的和这样算更快,不用accumlate()
int he(int*a,int m){
int k=0;
for(int i=1;i<m-1;i++){
k+=a[i];
}
return k;
}
int main(){
int n,m;
cin>>n>>m;
int* a=new int[m];
double* b=new double[n];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[j];
}
sort(a,a+m);
b[i]=double(he(a,m))/(m-2);
}
sort(b,b+n);
cout<<setiosflags(ios::fixed)<<setprecision(2);
cout<<b[n-1];
delete []a;
delete []b;
return 0;
}
测试:
2 4
1 2 3 4
5 8 3 1
结果: