intmain(){ int n, max_n = 0, min_n = 0; double max = 0.0, min = 10000.0; double sum = 0.0, a = 0.0, b = 0.0, Max = 0.0;
cin >> n; double in[n]; for (int i = 0; i < n; i++) { cin >> in[i]; sum += in[i]; if (in[i] > max) { max = in[i]; max_n = i; } if (in[i] < min) { min = in[i]; min_n = i; } }
a = (sum - max - min) / (n - 2); for (int i = 0; i < n; i++) { if (i != max_n && i != min_n) { b = fabs(in[i] - a); if (b > Max) { Max = b; } } } printf("%.2lf %.2lf", a, Max); return0; }