[Python] 백준 11650 & 백준 2798 & 백준 5597

# 백준 11650

n = int(input())
array = []
for _ in range(n):
     coord = list(map(int, input().split(' ')))
     array.append(coord)

print(array)
array.sort()
for i in array:
    print(i[0], i[1])

 

# 백준 2798

from itertools import combinations

n, m = map(int, input().split())
cards = list(map(int, input().split()))

three_cards = list(combinations(cards, 3))
max_sum = 0
for i in three_cards:
    if sum(i)> m:
        continue
    max_sum = max(max_sum, sum(i))

print(max_sum)

 

# 백준 5597

students = {}
for i in range(1, 31):
    students[i] = 0
for _ in range(28):
    n = int(sys.stdin.readline())
    students[n] = 1

for x,y in students.items():
    if y == 0:
        print(x)