From 58ed47df005c0b14ad48997c3fe1ef2788d07947 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Sun, 7 Dec 2025 23:55:48 +0900
Subject: [PATCH] =?UTF-8?q?[20251207]=20BOJ=20/=20G5=20/=20=ED=99=98?=
 =?UTF-8?q?=EC=8A=B9=20/=20=EB=91=90=20=EC=88=98=EC=9D=98=20=ED=95=A9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \354\210\230\354\235\230 \355\225\251.md" | 66 +++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 "Ukj0ng/202512/07 BOJ G5 \353\221\220 \354\210\230\354\235\230 \355\225\251.md"

diff --git "a/Ukj0ng/202512/07 BOJ G5 \353\221\220 \354\210\230\354\235\230 \355\225\251.md" "b/Ukj0ng/202512/07 BOJ G5 \353\221\220 \354\210\230\354\235\230 \355\225\251.md"
new file mode 100644
index 00000000..24d86e43
--- /dev/null
+++ "b/Ukj0ng/202512/07 BOJ G5 \353\221\220 \354\210\230\354\235\230 \355\225\251.md"	
@@ -0,0 +1,66 @@
+```
+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 N, K;
+
+    public static void main(String[] args) throws IOException {
+        int T = Integer.parseInt(br.readLine());
+
+        while (T-->0) {
+            init();
+            int answer = binarySearch();
+            bw.write(answer + "\n");
+        }
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        arr = new int[N];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(arr);
+    }
+
+    private static int binarySearch() {
+        int left = 0;
+        int right = N-1;
+
+        int minGap = (int)1e8 + 1;
+        int count = 0;
+
+        while (left < right) {
+            int sum = arr[left] + arr[right];
+            int gap = Math.abs(sum - K);
+
+            if (gap < minGap) {
+                minGap = gap;
+                count = 1;
+            } else if (gap == minGap) {
+                count++;
+            }
+
+            if (sum < K) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+
+        return count;
+    }
+}
+```