← Back to List
18228번: 펭귄추락대책위원회 ↗
Solutions
Python 3
98 B | 98 chars
n = int(input()) L = list(map(int,input().split())) k = L.index(-1) print(min(L[:k])+min(L[k+1:]))