RT，WA两个点

#include<bits/stdc++.h>
using namespace std;
int n, m;
int alls[110][110];
double p[110];
int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
			cin >> alls[i][j];
	//去掉最低分 
	for(int i = 1; i <= n; i ++)
	{
		int MIN = 999999999, MAX = 0, minid = 0, maxid = 0;
		for(int j = 1; j <= m; j ++)
		{
			if(alls[i][j] < MIN) MIN = alls[i][j], minid = j;
			if(alls[i][j] > MAX) MAX = alls[i][j], maxid = j;
		}
		alls[i][minid] = 0;
		alls[i][maxid] = 0;
	}	
	
	//算出平均分 
	for(int i = 1; i <= n; i ++)
	{
		int sum = 0;
		for(int j = 1; j <= m; j ++) sum += alls[i][j];
		p[i] = sum / (m - 2) * 1.0;	
	} 
	double maxn = 0;
	for(int i = 1; i <= n; i ++) maxn = max(maxn, p[i]);
	printf("%.2lf\n", maxn);
	return 0;
}