From aaaa48f4d5184af702a2d5cc84d4594fb7fc8904 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Sun, 31 Aug 2025 13:20:52 +0900
Subject: [PATCH] =?UTF-8?q?[20250831]=20BOJ=20/=20P5=20/=20=EA=B0=99?=
 =?UTF-8?q?=EC=9D=80=20=ED=83=91=20/=20=ED=95=9C=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \352\260\231\354\235\200 \355\203\221.md" | 63 +++++++++++++++++++
 1 file changed, 63 insertions(+)
 create mode 100644 "Ukj0ng/202508/31 BOJ P5 \352\260\231\354\235\200 \355\203\221.md"

diff --git "a/Ukj0ng/202508/31 BOJ P5 \352\260\231\354\235\200 \355\203\221.md" "b/Ukj0ng/202508/31 BOJ P5 \352\260\231\354\235\200 \355\203\221.md"
new file mode 100644
index 00000000..7fdf2f77
--- /dev/null
+++ "b/Ukj0ng/202508/31 BOJ P5 \352\260\231\354\235\200 \355\203\221.md"	
@@ -0,0 +1,63 @@
+```
+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[] block, dp;
+    private static int N, sum;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        DP();
+
+        int answer = dp[0] > 0 ? dp[0] : -1;
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+        sum = 0;
+
+        block = new int[N];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            block[i] = Integer.parseInt(st.nextToken());
+            sum += block[i];
+        }
+
+        dp = new int[sum + 1];
+        Arrays.fill(dp, -1);
+        dp[0] = 0;
+    }
+
+    private static void DP() {
+        for (int i = 0; i < N; i++) {
+            int[] newDp = dp.clone();
+
+            for (int j = 0; j <= sum; j++) {
+                if (dp[j] == -1) continue;
+
+                int higher = dp[j];
+                int lower = higher - j;
+
+                newDp[j + block[i]] = Math.max(newDp[j + block[i]], higher + block[i]);
+
+                int newLower = lower + block[i];
+                if (newLower > higher) {
+                    newDp[newLower - higher] = Math.max(newDp[newLower - higher], newLower);
+                } else {
+                    newDp[higher - newLower] = Math.max(newDp[higher - newLower], higher);
+                }
+            }
+
+            dp = newDp;
+        }
+    }
+}
+```