2309. 일곱 난쟁이

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

✔ 유형 : 완전 탐색

✔ 문제 풀이: 

def find():
    smalls = list()
    
    for i in range(9):
        height = int(input())
        smalls.append(height)
 
    
    for i in range(9):
        for j in range(i+1, 9):
            odd = smalls[i] + smalls[j]
            if sum(smalls) - odd == 100:
                if i > j : i , j = j , i
                
                smalls.pop(j)
                smalls.pop(i)
                return smalls
            
            
    return smalls
 
    
 
 
for s in sorted(find()) :
    print(s)