2908简单方法

#include <iostream>

#include <iomanip>

#include <vector>

#include <algorithm>

#include <cmath>

using namespace std;

int main() {

int n;

cin >> n;

vector<double>a(n);

double sum = 0, average, maxerr = 0;

for (int i = 0; i < n; i++) {

cin >> a[i];

}

sort(a.begin(), a.end());

for (int i = 1; i < n - 1; i++) {

sum += 1.0 * a[i];

}

average = (sum * 1.0 / (n - 2));

for (int i = 1; i < n - 1; i++) {

if (maxerr < fabs(a[i] - average))

maxerr = fabs(a[i] - average);

}

cout << fixed << setprecision(2);

cout << average << " " << maxerr << endl;

return 0;

}