1077 互评成绩计算 （20 分）

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N,M;
    scanf("%d %d",&N,&M);
    vector<int> v;
    int tea,count1,count2,min1=100000,max1=-1;
    double sum=0,count3=0;
    for(int i=0;i<N;i++)
    {
        sum=0,count3=0,min1=100000,max1=-1;
        scanf("%d",&count1);
        for(int j=0;j<N-1;j++)
        {
            scanf("%d",&count2);
            if(count2<=M&&count2>=0){
                sum += count2;
                count3++;
                if(count2>max1){
                    max1 = count2;
                }
                if(count2<min1)
                {
                    min1 = count2;
                }
            }
        }
        v.push_back(((sum-max1-min1)/(count3-2)+count1)/2+0.5);
    }
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i]<<endl;
    }
    return 0;
}