From 4cc04800fbd20a01eeab3d6efc65d36a5b3a1d3c Mon Sep 17 00:00:00 2001
From: zinnnn37 <zinnnn37@gmail.com>
Date: Wed, 11 Feb 2026 23:48:12 +0900
Subject: [PATCH] =?UTF-8?q?[20260211]=20BOJ=20/=20G1=20/=20=EC=B9=B4?=
 =?UTF-8?q?=EB=93=9C=20=EA=B2=8C=EC=9E=84=20/=20=EA=B9=80=EB=AF=BC?=
 =?UTF-8?q?=EC=A7=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4\353\223\234 \352\262\214\354\236\204.md" | 91 +++++++++++++++++++
 1 file changed, 91 insertions(+)
 create mode 100644 "zinnnn37/202602/11 BOJ G1 \354\271\264\353\223\234 \352\262\214\354\236\204.md"

diff --git "a/zinnnn37/202602/11 BOJ G1 \354\271\264\353\223\234 \352\262\214\354\236\204.md" "b/zinnnn37/202602/11 BOJ G1 \354\271\264\353\223\234 \352\262\214\354\236\204.md"
new file mode 100644
index 00000000..853d7117
--- /dev/null
+++ "b/zinnnn37/202602/11 BOJ G1 \354\271\264\353\223\234 \352\262\214\354\236\204.md"	
@@ -0,0 +1,91 @@
+```java
+import java.io.*;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class BJ_16566_카드_게임 {
+
+    private static final BufferedReader  br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter  bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static final StringBuilder   sb = new StringBuilder();
+    private static       StringTokenizer st;
+
+    private static int N, M, K;
+    private static int[] cards, choices, parents;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        sol();
+    }
+
+    private static void init() throws IOException {
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        cards = new int[M];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < M; i++) {
+            cards[i] = Integer.parseInt(st.nextToken());
+        }
+        Arrays.sort(cards);
+
+        choices = new int[K];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < K; i++) {
+            choices[i] = Integer.parseInt(st.nextToken());
+        }
+
+        parents = new int[M + 1];
+        for (int i = 0; i < M; i++) {
+            parents[i] = i;
+        }
+    }
+
+    private static void sol() throws IOException {
+        for (int i = 0; i < K; i++) {
+            int target = find(upperBound(choices[i]));
+            sb.append(cards[parents[target]]).append("\n");
+
+            union(target, target + 1);
+        }
+        bw.write(sb.toString());
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static int upperBound(int choice) {
+        int left  = 0;
+        int right = M - 1;
+
+        while (left < right) {
+            int mid = left + (right - left) / 2;
+
+            if (cards[mid] <= choice) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return right;
+    }
+
+    private static int find(int a) {
+        if (parents[a] == a) {
+            return a;
+        }
+
+        return parents[a] = find(parents[a]);
+    }
+
+    private static void union(int a, int b) {
+        int rootA = find(a);
+        int rootB = find(b);
+
+        parents[rootA] = rootB;
+    }
+
+}
+```
\ No newline at end of file