From c0680ace8c72280f403f349169af4cf26bf921f9 Mon Sep 17 00:00:00 2001
From: Ho-Da-Dak <100784510+subsub97@users.noreply.github.com>
Date: Thu, 7 Aug 2025 00:07:21 +0900
Subject: [PATCH] =?UTF-8?q?Revert=20"[20250807]=20BAJ/G5/=EA=B0=9C?=
 =?UTF-8?q?=EB=98=A5=EB=B2=8C=EB=A0=88/=EA=B9=80=EB=93=9D=ED=98=B8=20(#525?=
 =?UTF-8?q?)"?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

This reverts commit 660b64be868b4c13d133ffb4c9fef0be4ecbf77a.
---
 ...34\353\230\245\353\262\214\353\240\210.md" | 76 -------------------
 1 file changed, 76 deletions(-)
 delete mode 100644 "Ho/202508/6 \352\260\234\353\230\245\353\262\214\353\240\210.md"

diff --git "a/Ho/202508/6 \352\260\234\353\230\245\353\262\214\353\240\210.md" "b/Ho/202508/6 \352\260\234\353\230\245\353\262\214\353\240\210.md"
deleted file mode 100644
index a8b77ca..0000000
--- "a/Ho/202508/6 \352\260\234\353\230\245\353\262\214\353\240\210.md"	
+++ /dev/null
@@ -1,76 +0,0 @@
-```java
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.Arrays;
-import java.util.StringTokenizer;
-
-public class Main {
-    static int N,H;
-
-    public static void main(String[] args) throws IOException {
-        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-        StringTokenizer st = new StringTokenizer(br.readLine());
-
-        N = Integer.parseInt(st.nextToken());
-        H = Integer.parseInt(st.nextToken());
-
-        int[] up;
-        int[] down;
-
-        up = new int[N/2];
-        down = new int[N/2];
-
-        for (int i = 0; i < N; i++) {
-            if(i % 2 == 0) {
-                down[i/2] = Integer.parseInt(br.readLine());
-            }
-            else {
-                up[i/2] = Integer.parseInt(br.readLine());
-            }
-        }
-
-        Arrays.sort(up);
-        Arrays.sort(down);
-
-        // 최소 개수랑, 해당 구간을 구해야한다.
-        int min = N;
-        int cnt = 0;
-
-        for(int i = 1; i <= H; i++) {
-            int upConflict = binarySearch(down, i);
-            int downConflict = binarySearch(up, H - i + 1);
-
-            int sum = upConflict + downConflict;
-            if(min == sum) {
-                cnt++;
-                continue;
-            }
-            if(min > sum) {
-                min = sum;
-                cnt = 1;
-            }
-        }
-
-        System.out.println(min + " " + cnt);
-
-    }
-
-    private static int binarySearch(int[] arr, int target) {
-        int l = 0;
-        int r = (N/2);
-
-        while(l < r) {
-            int mid = (l + r) / 2;
-            int num = arr[mid];
-
-            if(num >= target) {
-                r = mid;
-            } else if(num < target) {
-                l = mid + 1;
-            }
-        }
-        return arr.length - r;
-    }
-}
-```
\ No newline at end of file