蒟蒻求调

#include <bits/stdc++.h>
using namespace std;
int n,m,b;
int a[110];
int main(){
    cin>>n>>m;
    double a = 0,b2 = 0,c = 0;
    b = m - 2;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++) cin>>a[j];
        sort(a + 1,a + 1 + m);
        for(int sum = 2;sum < m;sum++) b2 += a[sum];
        a = b2 / b;
        if(a > c) c = a;
        a = 0;
        b2 = 0;
    }
    printf("%.2lf" ,c);
    return 0;
}