From b5a7ca6077eb7fbbb4c25b1d93bdceacb721c1cd Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Thu, 4 Sep 2025 20:47:25 +0900
Subject: [PATCH] =?UTF-8?q?[20250904]=20BOJ=20/=20P5=20/=20Two=20Machines?=
 =?UTF-8?q?=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

---
 Ukj0ng/202509/4 BOJ P5 Two Machines.md | 68 ++++++++++++++++++++++++++
 1 file changed, 68 insertions(+)
 create mode 100644 Ukj0ng/202509/4 BOJ P5 Two Machines.md

diff --git a/Ukj0ng/202509/4 BOJ P5 Two Machines.md b/Ukj0ng/202509/4 BOJ P5 Two Machines.md
new file mode 100644
index 00000000..a595384c
--- /dev/null
+++ b/Ukj0ng/202509/4 BOJ P5 Two Machines.md	
@@ -0,0 +1,68 @@
+```
+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 final int INF = 70000;
+    private static int[][] task;
+    private static int[][] dp;
+    private static int N, maxTime;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        DP();
+
+        int answer = INF;
+        for (int j = 0; j <= maxTime; j++) {
+            if (dp[N][j] != INF) {
+                answer = Math.min(answer, Math.max(j, dp[N][j]));
+            }
+        }
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+        int a = 0;
+        int b = 0;
+
+        task = new int[2][N];
+
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            task[0][i] = Integer.parseInt(st.nextToken());
+            task[1][i] = Integer.parseInt(st.nextToken());
+
+            a += task[0][i];
+            b += task[1][i];
+        }
+
+        maxTime = Math.max(a, b);
+
+        dp = new int[N + 1][maxTime + 1];
+        for (int i = 0; i <= N; i++) {
+            Arrays.fill(dp[i], INF);
+        }
+        dp[0][0] = 0;
+    }
+
+    private static void DP() {
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j <= maxTime; j++) {
+                if (dp[i][j] == INF) continue;
+
+                if (j + task[0][i] <= maxTime) dp[i + 1][j + task[0][i]] = Math.min(dp[i + 1][j + task[0][i]], dp[i][j]);
+
+                dp[i + 1][j] = Math.min(dp[i + 1][j], dp[i][j] + task[1][i]);
+            }
+        }
+    }
+}
+
+```