样例过了，检查很多次没什么问题

三个AC，六个WA，一个RE

#include <iostream>
#include <algorithm>
using namespace std;
const int N=150;
int n,m;
struct Node
{
  int order;
  int s[N];
  double ave;
  int maxn;
  int minn;
} a[N];
bool cmp(Node x,Node y)
{
  if(x.ave<y.ave)return x.order<y.order;
  if(x.ave>y.ave)return x.order>y.order;
  if(x.ave=y.ave)
    return (x.order<y.order)?x.order<y.order:x.order>y.order;
}
int main()
{
  cin>>n>>m;
  for(int i=1; i<=n; i++)a[i].order=i;
  for(int i=1; i<=n; i++)
    for(int j=1; j<=m; j++)
      cin>>a[i].s[j];
  for(int i=1; i<=n; i++)
    for(int j=1; j<=m; j++)
      a[i].ave+=a[i].s[j];
  for(int i=1; i<=n; i++)
    for(int j=1; j<=m; j++)
    {
      if(a[i].s[j]>a[i].maxn)a[i].maxn=a[i].s[j];
      if(a[i].s[j]<a[i].minn)a[i].minn=a[i].s[j];
    }
  for(int i=1; i<=n; i++)a[i].ave-=a[i].maxn+a[i].minn,a[i].ave=a[i].ave*1.0/(m-2);
  sort(a+1,a+n+1,cmp);
  for(int i=1; i<=n; i++)cout<<a[i].order<<' ';
  return 0;
}