백준 20115

 

https://www.acmicpc.net/problem/20115

20115번: 에너지 드링크

 

#내코드

from collections import deque
n = int(input())
lst = list(map(int, input().split()))

lst.sort()
lst = deque(lst)

while len(lst) > 1:
    first = lst.popleft()
    second = lst.pop() 
    lst.append(first/2 + second)
print(lst[0])

 

 

#참고코드
n = int(input())
lst = list(map(int, input().split()))

a = max(lst)
b = sum(lst) - a

print(a + (b/2))