@[zhaoyichen2010](/user/512273) 你要把他们排序后再计算
by xiaoxiaoyyds @ 2023-08-24 08:18:56
```cpp
for(int j=0;j<m-1;j++){
for(int k=0;k<=n-j-1;k++){
if(a[k]>a[k+1]){
int q=a[k];
a[k]=a[k+1];
a[k+1]=q;
}
}
}
```
这个是排序
by zhaoyichen2010 @ 2023-08-24 08:23:02
@[zhaoyichen2010](/user/512273) 找到了，s要初始化为=0
```cpp
#include<bits/stdc++.h>
using namespace std;
long long a[10000000];
int main(){
long long n,m;
long double s=0,max=0,t;
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) cin>>a[j];
sort(a,a+m);
for(int j=1;j<m-1;j++) s+=a[j];
s/=(m-2.0);
if(s>max) max=s;
s=0;
}
cout<<fixed<<setprecision(2)<<max;
return 0;
}
```
by xiaoxiaoyyds @ 2023-08-24 08:25:41
@[xiaoxiaoyyds](/user/793036) %%%%
by zhaoyichen2010 @ 2023-08-24 09:26:14