n=int(input())
L=[int(input()) for i in range (n)]
L.sort()
while len(L)!=1:
L.insert(0,(L.pop(0)+L.pop(0))/2)
print(L[0])
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
3664 KB |
Output is correct |
2 |
Correct |
26 ms |
3344 KB |
Output is correct |
3 |
Correct |
26 ms |
3300 KB |
Output is correct |
4 |
Correct |
25 ms |
3300 KB |
Output is correct |
5 |
Correct |
25 ms |
3300 KB |
Output is correct |
6 |
Correct |
27 ms |
3300 KB |
Output is correct |
7 |
Correct |
27 ms |
3300 KB |
Output is correct |
8 |
Correct |
26 ms |
3300 KB |
Output is correct |
9 |
Correct |
25 ms |
3300 KB |
Output is correct |
10 |
Correct |
25 ms |
3428 KB |
Output is correct |