From 35c6929818394fb40427fe2096225e866f0381cb Mon Sep 17 00:00:00 2001 From: LiiNi-coder <97495437+LiiNi-coder@users.noreply.github.com> Date: Mon, 4 Aug 2025 23:56:30 +0900 Subject: [PATCH] =?UTF-8?q?Create=2004=20BOJ=20=ED=98=B8=ED=85=94.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../04 BOJ \355\230\270\355\205\224.md" | 46 +++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 "LiiNi-coder/202508/04 BOJ \355\230\270\355\205\224.md" diff --git "a/LiiNi-coder/202508/04 BOJ \355\230\270\355\205\224.md" "b/LiiNi-coder/202508/04 BOJ \355\230\270\355\205\224.md" new file mode 100644 index 00000000..6813049c --- /dev/null +++ "b/LiiNi-coder/202508/04 BOJ \355\230\270\355\205\224.md" @@ -0,0 +1,46 @@ +```java +import java.io.BufferedReader; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +public class Main { + + static int C, N; + static int[] cost, customer; + static int[] dp; + static final int INF = 100000; + + public static void main(String[] args) throws Exception { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + C = Integer.parseInt(st.nextToken()); + N = Integer.parseInt(st.nextToken()); + cost = new int[N]; + customer = new int[N]; + for (int i = 0; i < N; i++) { + st = new StringTokenizer(br.readLine()); + cost[i] = Integer.parseInt(st.nextToken()); + customer[i] = Integer.parseInt(st.nextToken()); + } + + dp = new int[INF]; + for (int i = 0; i < INF; i++) { + dp[i] = 0; + } + + for (int i = 0; i < N; i++) { + for (int j = cost[i]; j < INF; j++) { + dp[j] = Math.max(dp[j], dp[j - cost[i]] + customer[i]); + } + } + int answer = Integer.MAX_VALUE; + for (int i = 0; i < INF; i++) { + if (dp[i] >= C) { + answer = i; + break; + } + } + System.out.println(answer); + } +} +```