알고리즘/백준
[백준] 2437 - 저울 (파이썬)
소갱
2021. 9. 22. 14:20
n = int(input())
array = list(map(int,input().split()))
array.sort()
total = [0,array[0]]
cnt = array[0]
cnt += 1
k = 0
if array[0] > 1:
print(1)
else:
for i in range(1,n):
for j in range(len(total)):
if array[i]+total[j] > cnt:
print(cnt)
k = 1
break
elif array[i]+total[j] == cnt:
total.append(cnt)
cnt += 1
if k==1:
break
if k == 0:
print(cnt)