[BOJ] #2565 전깃줄 / 골드5 / 60분(실패)

Author: Mingguriguri

minjeong/DynamicProgramming/2024-04-04-[백준]-#2565-전깃줄.py

@@ -0,0 +1,16 @@
+n = int(input())
+lists = []
+dp = [1]*n
+
+for i in range(n):
+  a, b = map(int, input().split())
+  lists.append([a, b])
+
+lists.sort()
+
+for i in range(1, n):
+  for j in range(0, i):
+    if lists[j][1] < lists[i][1]:
+      dp[i] = max(dp[i], dp[j]+1)
+      
+print(n-max(dp))