From f985ea4b8fcc90d10b0417fe4c38bd31536097d2 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Sat, 22 Nov 2025 13:01:17 +0900
Subject: [PATCH] =?UTF-8?q?[20251122]=20BOJ=20/=20G5=20/=20=EB=91=90=20?=
 =?UTF-8?q?=EC=9A=A9=EC=95=A1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \353\221\220 \354\232\251\354\225\241.md" | 77 +++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 "Ukj0ng/202511/22 BOJ G5 \353\221\220 \354\232\251\354\225\241.md"

diff --git "a/Ukj0ng/202511/22 BOJ G5 \353\221\220 \354\232\251\354\225\241.md" "b/Ukj0ng/202511/22 BOJ G5 \353\221\220 \354\232\251\354\225\241.md"
new file mode 100644
index 00000000..a421f7c8
--- /dev/null
+++ "b/Ukj0ng/202511/22 BOJ G5 \353\221\220 \354\232\251\354\225\241.md"	
@@ -0,0 +1,77 @@
+```
+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, answer;
+    private static int N, diff;
+    public static void main(String[] args) throws IOException {
+        init();
+        solve();
+
+        bw.write(answer[0] + " " + answer[1] + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+        arr = new int[N];
+        answer = new int[2];
+        diff = 2000000001;
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(arr);
+    }
+
+    private static void solve() {
+        for (int i = 0; i < N-1; i++) {
+            binarySearch(i);
+        }
+    }
+
+    private static void binarySearch(int start) {
+        int left = start+1;
+        int right = N-1;
+
+        while (left <= right) {
+            int mid = left + (right-left)/2;
+            int temp = arr[start]+arr[mid];
+
+
+            if (temp < 0) {
+                if (refresh(temp)) {
+                    answer[0] = arr[start];
+                    answer[1] = arr[mid];
+                    diff = Math.abs(temp);
+                }
+                left = mid+1;
+            } else if (temp == 0) {
+                answer[0] = arr[start];
+                answer[1] = arr[mid];
+                diff = 0;
+                return;
+            } else {
+                if (refresh(temp)) {
+                    answer[0] = arr[start];
+                    answer[1] = arr[mid];
+                    diff = Math.abs(temp);
+                }
+                right = mid-1;
+            }
+        }
+    }
+
+    private static boolean refresh(int num) {
+        return Math.abs(num) < diff;
+    }
+}
+```