一、题目
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210627175747449.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5ODczMDcy,size_16,color_FFFFFF,t_70)
二、源代码
#include<stdio.h>
int main()
{
int n,m,i,j,min,max;
scanf("%d %d",&n,&m);
int fenshu[n][n],count[n];
double sum[n];
for(i=0;i<n;i++)
{
min=max=1;
count[i]=n-1;
sum[i]=0;
for(j=0;j<n;j++)
{
scanf("%d",&fenshu[i][j]);
if(j>0)
{
if(fenshu[i][j]<0 || fenshu[i][j]>m)
{
fenshu[i][j]=-1;
count[i]--;
if(j==max)max++;
if(j==min)min++;
}
else
{
if(fenshu[i][j]>fenshu[i][max])max=j;
if(fenshu[i][j]<fenshu[i][min])min=j;
}
}
}
for(j=1;j<n;j++)
{
if(fenshu[i][j]!=-1 && j!=max && j!=min) sum[i]+=fenshu[i][j];
}
sum[i]=(fenshu[i][0]+sum[i]/(count[i]-2))/2;
printf("%d\n",(int)(sum[i]+0.5));
}
return 0;
}
三、运行结果
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210627175813806.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5ODczMDcy,size_16,color_FFFFFF,t_70)