[백준] 2309번 일곱 난쟁이

문제

• 브론즈1 2309번
  

코드

height=[]
sum=0
for i in range(9):
    x=int(input())
    height.append(x)
    sum+=x
check=[]
for i in range(8):
    for j in range(i+1, 9):
        check.append([height[i], height[j]])
for i in range(len(check)):
    if check[i][0]+check[i][1]==(sum-100):
        height.remove(check[i][0])
        height.remove(check[i][1])
        break
height.sort()
for i in range(len(height)):
    print(height[i])