打了半天 结果没法输了完全

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n, m, q[114514];
	double total[114514];
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= m; j++) {
			cin >> q[j];
		}
		sort(q+1,q+1+m);
		q[1] = 0;
		q[m] = 0;
		for (int k = 1; k < m; k++){
			total[i] += q[k];
			q[k] = 0;
		}
		total[i] /= (m-2); 
	}
	sort(total+1,total+1+n);
	printf("%.2lf", total[n]);
	return 0;
}