백준 2565 - 전깃줄 (파이썬)

Answer

n = int(input())
a = [list(map(int, input().split())) for _ in range(n)]
dp = [1] * n
a.sort(key = lambda x : x[0])

for i in range(n):
    for j in range(i):
        if a[i][1] > a[j][1]:
            dp[i] = max(dp[i], dp[j] + 1)

print(n - max(dp))