1 solutions
-
0
Guest MOD
-
1
#include<bits/stdc++.h> using namespace std; int n; double a[20001]; double minn = 32768.0, maxn = -1.0, ans=0; int qqq, www; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { if (a[i] >= maxn) { maxn = a[i]; qqq = i; } if (a[i] <= minn) { minn = a[i]; www = i; } } a[qqq] = a[www] = 0; for (int i = 1; i <= n; i++) { ans = ans + a[i]; } ans = ans / (n-2); printf("%.2lf", ans); cout << " "; maxn = -40000.0; for (int i = 1; i <= n; i++) { if (abs(a[i]-ans) >= maxn&&a[i]!=0) { maxn = abs(a[i]-ans); } } printf("%.2lf", maxn); return 0; }
- 1
Information
- ID
- 720
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 29
- Accepted
- 14
- Uploaded By