i=1；
while(i<=n-1)
(0~n-1)是n個?（1~n-1）是?n-1個
#include<stdio.h>void?main()
{
int?n,y,i=1,min,max,z=0;
scanf("%d",&n);
scanf("%d",&y);
min=max=y;
while(i<=n-1)
{
z+=y;//前n-2項和
if(i==(n-1))?//n+1?項跳出不繼續輸入
{
break;
}
i++;//第n+1?項
scanf("%d",&y);
if(max<y)?//n+1項判斷
max=y;
if(min>y)
min=y;
}
z=(z-min-max)/(n-2);
printf("%.2lf\n",z);
}