#include <bits/stdc++.h>
using namespace std;
int main()
{
int N; cin >> N;
int vals[N];
for(int i = 0; i < N; i++){
cin >> vals[i];
}
std::sort(vals,vals+N);
double a = (double)vals[0];
int i = 1;
while(i<N){
a = (a + vals[i])/2;
i++;
}
cout << a;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
296 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
304 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
2 ms |
300 KB |
Output is correct |