From e0847e73f39e4b62e7644fe82aa52b7e35b92f8b Mon Sep 17 00:00:00 2001
From: zinnnn37 <102711874+zinnnn37@users.noreply.github.com>
Date: Tue, 27 Jan 2026 22:50:16 +0900
Subject: [PATCH] =?UTF-8?q?[20260127]=20BOJ=20/=20G3=20/=20=EC=84=B8=20?=
 =?UTF-8?q?=EC=9A=A9=EC=95=A1=20/=20=EA=B9=80=EB=AF=BC=EC=A7=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \354\204\270 \354\232\251\354\225\241.md" | 70 +++++++++++++++++++
 1 file changed, 70 insertions(+)
 create mode 100644 "zinnnn37/202601/27 BOJ G3 \354\204\270 \354\232\251\354\225\241.md"

diff --git "a/zinnnn37/202601/27 BOJ G3 \354\204\270 \354\232\251\354\225\241.md" "b/zinnnn37/202601/27 BOJ G3 \354\204\270 \354\232\251\354\225\241.md"
new file mode 100644
index 00000000..3a7ce460
--- /dev/null
+++ "b/zinnnn37/202601/27 BOJ G3 \354\204\270 \354\232\251\354\225\241.md"	
@@ -0,0 +1,70 @@
+```java
+import java.io.*;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class BJ_2473_세_용액 {
+
+    private static final BufferedReader  br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter  bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static       StringTokenizer st;
+
+    private static int N, selected, left, right;
+    private static long sum, min;
+    private static int[] solutions, idx;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        sol();
+
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+        min = Long.MAX_VALUE;
+
+        idx = new int[3];
+        solutions = new int[N];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            solutions[i] = Integer.parseInt(st.nextToken());
+        }
+        Arrays.sort(solutions);
+    }
+
+    private static void sol() throws IOException {
+        for (int i = 0; i < N - 2; i++) {
+            selected = solutions[i];
+
+            left = i + 1;
+            right = N - 1;
+            while (left < right) {
+                sum = (long) solutions[left] + solutions[right] + selected;
+                System.out.println(selected + " " + solutions[left] + " " + solutions[right]);
+                System.out.println(sum + " " + min);
+
+                if (Math.abs(sum) < min) {
+                    min = Math.abs(sum);
+                    idx[0] = i;
+                    idx[1] = left;
+                    idx[2] = right;
+                }
+
+                if (sum == 0) {
+                    bw.write(selected + " " + solutions[left] + " " + solutions[right]);
+                    return;
+                } else if (sum < 0) {
+                    left++;
+                } else {
+                    right--;
+                }
+            }
+        }
+        bw.write(solutions[idx[0]] + " " + solutions[idx[1]] + " " + solutions[idx[2]]);
+    }
+
+}
+```