题号：U495875

#include <bits/stdc++.h>
using namespace std;

const int N = 25;

int main()
{
	int n,m;
	cin >> n >> m;
	double maxping = INT_MIN * 1.00;
	for(int i = 1;i <= n;i++)
	{
		int m1[N];
		int maxid,maxn = INT_MIN;
		int minid,minn = INT_MAX;
		for(int j = 1;j <= m;j++)
		{
			cin >> m1[j];
			if(m1[j] < minn)
			{
				minid = j;
				minn = m1[j];
			}
			if(m1[j] > maxn)
			{
				maxid = j;
				maxn = m1[j];
			}
		}
		double ping = 0;
		for(int j = 1;j <= m;j++)
		{
			if(j == minid || j == maxid)
			{
				continue;
			}
			else
			{
				ping += m1[j] * 1.00;
			}
		}
		maxping = max(maxping,(ping * 1.0) / ((m - 2) * 1.0));
	}
	printf("%.2f\n",maxping);
	return 0;
}

有好心人能帮忙看看吗？