C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,x,a[100],i,s = 0,max = 0,min = INT_MAX;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
		s = s + a[i];
		
		if(a[i] > max) max = a[i];
		if(a[i] < min) min = a[i];
	}
	sort(a,a+n);
	
	double v = (s - max - min) * 1.0 / (n - 2);
	cout<<fixed<<setprecision(1)<<v<<endl;
	for(i = 1;i <= n - 2;i++){
		cout<<a[i]<<" ";
	}
}

Pascal :

var a:array[1..100000] of longint;
    n,i,j,t:longint;
    s:real;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n-1 do
for j:=i+1 to n do
if a[j]<a[i] then begin t:=a[i];a[i]:=a[j];a[j]:=t;end;
for i:=2 to n-1 do
s:=s+a[i];
s:=s/(n-2);
writeln(s:0:1);
for i:=2 to n-1 do
write(a[i],' ');
end.

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0 ; i < n ; i++)
        {
        	a[i] = sc.nextInt();
        }
        //冒泡排序
        int t = 0;
    	for(int i = 1;i <= n - 1;i++){
            for(int j = 0;j <= n - i - 1;j++){
                if(a[j] > a[j+1]){
                    t = a[j];
                    a[j] = a[j+1];
                    a[j+1] = t;
                }
            }
        }
        int s = 0;
        double z = 0;
        for(int i = 1 ; i < n-1 ; i++)
        {
        	s = s + a[i];
        }
        z = s*1.0/(n-2);
        System.out.println(String.format("%.1f",z));
        for(int i = 1 ; i < n-1 ; i++)
        {
        	System.out.print(a[i]+" ");
        }

       
    }
}

Python :

n=int(input())
s=list(map(int,input().split()))

s.sort()
s=s[1:len(s)-1]
print("%.1lf"%(sum(s)/len(s)))
print(" ".join(list(map(str,s))))