oj.uz

Submission #161445

# Submission time Handle Problem Language Result Execution time Memory
161445 2019-11-02T15:19:24 Z boolodifjenula Prosjek (COCI18_prosjek) Python 3
50 / 50
 27 ms 3664 KB 
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])

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory 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