#include <bits/stdc++.h>
using namespace std;
const int maxn = 30;
int v[maxn];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> v[i];
sort(v+1, v+1+n);
double ans = (double)v[1];
for (int i = 2; i <= n; i++) ans = (ans + v[i])/2.0;
cout.precision(6);
cout.setf(ios::fixed);
cout << ans << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
400 KB |
Output is correct |
4 |
Correct |
2 ms |
640 KB |
Output is correct |
5 |
Correct |
2 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
676 KB |
Output is correct |
7 |
Correct |
2 ms |
676 KB |
Output is correct |
8 |
Correct |
2 ms |
676 KB |
Output is correct |
9 |
Correct |
2 ms |
676 KB |
Output is correct |
10 |
Correct |
2 ms |
676 KB |
Output is correct |