C++ :

#include <bits/stdc++.h>
using namespace std;
int n,a[20005],sum;
double ans;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		sum+=a[i];
	}
	sort(a,a+n);
	sum=sum-a[0]-a[n-1];
	ans=1.0*sum/(n-2);
	int t=(ans+0.05)*10;
	double avg=1.0*t/10;
	cout<<avg;
	return 0;
}

Pascal :

var
  n,i,fs,s,max,min:longint;
begin
  max:=-maxlongint;
  min:=maxlongint;
  readln(n);
  for i:=1 to n do
    begin
      read(fs);
      s:=s+fs;
      if fs>max then max:=fs;
      if fs<min then min:=fs;
    end;
  s:=s-max-min;
  writeln(s/(n-2):0:1);
end.