From 0d5dd4d8b868136a56ef3aeb1d16b966091e2a14 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Thu, 11 Dec 2025 18:39:22 +0900
Subject: [PATCH] =?UTF-8?q?[20251211]=20BOJ=20/=20G5=20/=20=EC=A0=84?=
 =?UTF-8?q?=EA=B9=83=EC=A4=84=20/=20=ED=95=9C=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...5 \354\240\204\352\271\203\354\244\204.md" | 73 +++++++++++++++++++
 1 file changed, 73 insertions(+)
 create mode 100644 "Ukj0ng/202512/11 BOJ G5 \354\240\204\352\271\203\354\244\204.md"

diff --git "a/Ukj0ng/202512/11 BOJ G5 \354\240\204\352\271\203\354\244\204.md" "b/Ukj0ng/202512/11 BOJ G5 \354\240\204\352\271\203\354\244\204.md"
new file mode 100644
index 00000000..f8122144
--- /dev/null
+++ "b/Ukj0ng/202512/11 BOJ G5 \354\240\204\352\271\203\354\244\204.md"	
@@ -0,0 +1,73 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static int[][] arr;
+    private static int[] memo;
+    private static int N;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        int maxLen = DP();
+
+        bw.write((N-maxLen) + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+
+        arr = new int[N][2];
+        memo = new int[N];
+
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+
+            arr[i][0] = a;
+            arr[i][1] = b;
+        }
+
+        Arrays.sort(arr, (o1, o2) -> Integer.compare(o1[0], o2[0]));
+    }
+
+    private static int DP() {
+        int len = 0;
+
+        for (int i = 0; i < N; i++) {
+            int key = arr[i][1];
+
+            if (len == 0 || memo[len - 1] < key) {
+                memo[len] = key;
+                len++;
+            } else {
+                int index = binarySearch(len - 1, key);
+                memo[index] = key;
+            }
+        }
+
+        return len;
+    }
+
+    private static int binarySearch(int right, int key) {
+        int left = 0;
+
+        while (left < right) {
+            int mid = left + (right-left)/2;
+
+            if (memo[mid] >= key) {
+                right = mid;
+            }
+            else left = mid+1;
+        }
+
+        return right;
+    }
+}
+```