From dc9f5ab4c31eccad8dd8bdb692dd83936ff7e546 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Mon, 13 Oct 2025 17:34:34 +0900
Subject: [PATCH] =?UTF-8?q?[20251013]=20BOJ=20/=20G5=20/=20=EA=B3=84?=
 =?UTF-8?q?=EB=9E=80=EC=9C=BC=EB=A1=9C=20=EA=B3=84=EB=9E=80=EC=B9=98?=
 =?UTF-8?q?=EA=B8=B0=20/=20=EC=9D=B4=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...04\353\236\200\354\271\230\352\270\260.md" | 60 +++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 "JHLEE325/202510/13 BOJ G5 \352\263\204\353\236\200\354\234\274\353\241\234 \352\263\204\353\236\200\354\271\230\352\270\260.md"

diff --git "a/JHLEE325/202510/13 BOJ G5 \352\263\204\353\236\200\354\234\274\353\241\234 \352\263\204\353\236\200\354\271\230\352\270\260.md" "b/JHLEE325/202510/13 BOJ G5 \352\263\204\353\236\200\354\234\274\353\241\234 \352\263\204\353\236\200\354\271\230\352\270\260.md"
new file mode 100644
index 00000000..4eaae62b
--- /dev/null
+++ "b/JHLEE325/202510/13 BOJ G5 \352\263\204\353\236\200\354\234\274\353\241\234 \352\263\204\353\236\200\354\271\230\352\270\260.md"	
@@ -0,0 +1,60 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int n;
+    static int[] str, weight;
+    static int answer = 0;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        n = Integer.parseInt(br.readLine());
+        str = new int[n];
+        weight = new int[n];
+
+        for (int i = 0; i < n; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            str[i] = Integer.parseInt(st.nextToken());
+            weight[i] = Integer.parseInt(st.nextToken());
+        }
+
+        dfs(0);
+        System.out.println(answer);
+    }
+
+    static void dfs(int idx) {
+        if (idx == n) {
+            int broken = 0;
+            for (int i = 0; i < n; i++) {
+                if (str[i] <= 0) broken++;
+            }
+            answer = Math.max(answer, broken);
+            return;
+        }
+
+        if (str[idx] <= 0) {
+            dfs(idx + 1);
+            return;
+        }
+
+        boolean hit = false;
+
+        for (int i = 0; i < n; i++) {
+            if (i == idx || str[i] <= 0) continue;
+
+            hit = true;
+
+            str[idx] -= weight[i];
+            str[i] -= weight[idx];
+
+            dfs(idx + 1);
+
+            str[idx] += weight[i];
+            str[i] += weight[idx];
+        }
+
+        if (!hit) dfs(idx + 1);
+    }
+}
+```