From aa11a2892f0c35f1692155b38672bf4bfa800192 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Mon, 21 Jul 2025 23:25:32 +0900
Subject: [PATCH] =?UTF-8?q?[20250721]=20BOJ=20/=20G4=20/=20=EA=B3=B5?=
 =?UTF-8?q?=EC=9C=A0=EA=B8=B0=20=EC=84=A4=EC=B9=98=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\352\270\260 \354\204\244\354\271\230.md" | 60 +++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 "JHLEE325/202507/21 BOJ G4 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md"

diff --git "a/JHLEE325/202507/21 BOJ G4 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md" "b/JHLEE325/202507/21 BOJ G4 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md"
new file mode 100644
index 00000000..43e84d9f
--- /dev/null
+++ "b/JHLEE325/202507/21 BOJ G4 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md"	
@@ -0,0 +1,60 @@
+```java
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int n, c;
+    static int[] house;
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        st = new StringTokenizer(br.readLine());
+        n = Integer.parseInt(st.nextToken());
+        c = Integer.parseInt(st.nextToken());
+
+        house = new int[n];
+        for (int i = 0; i < n; i++) {
+            house[i] = Integer.parseInt(br.readLine());
+        }
+
+        Arrays.sort(house);
+
+        int low = 1;
+        int high = house[n - 1] - house[0];
+        int answer = 0;
+
+        while (low <= high) {
+            int mid = (low + high) / 2;
+
+            if (canInstall(mid)) {
+                answer = mid;
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+
+        System.out.println(answer);
+    }
+
+    static boolean canInstall(int distance) {
+        int count = 1;
+        int lastInstalled = house[0];
+
+        for (int i = 1; i < n; i++) {
+            if (house[i] - lastInstalled >= distance) {
+                count++;
+                lastInstalled = house[i];
+            }
+        }
+
+        return count >= c;
+    }
+}
+
+```