奉上题解…

#include <iostream>
#include<algorithm>
using namespace std;
double a[30005];
int main(){
    int n;
    cin >> n;
    double sum = 0;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
        sum += a[i];
    }
    sort(a+1,a+1+n);
    double ave=(sum - a[1] - a[n])/(n - 2);
    printf("%.2f ",ave);
    double ans=abs(ave - a[2]);
    printf("%.2f",ans);
    return 0;
}