From a21b42330d5aecbe6df6ce26d6df9ed3b49b603e Mon Sep 17 00:00:00 2001 From: zinnnn37 Date: Mon, 1 Sep 2025 22:54:14 +0900 Subject: [PATCH] =?UTF-8?q?[20250901]=20BOJ=20/=20G4=20/=20=ED=98=B8?= =?UTF-8?q?=ED=85=94=20/=20=EA=B9=80=EB=AF=BC=EC=A7=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../1 BOJ G4 \355\230\270\355\205\224.md" | 60 +++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 "zinnnn37/202509/1 BOJ G4 \355\230\270\355\205\224.md" diff --git "a/zinnnn37/202509/1 BOJ G4 \355\230\270\355\205\224.md" "b/zinnnn37/202509/1 BOJ G4 \355\230\270\355\205\224.md" new file mode 100644 index 00000000..d65f85b3 --- /dev/null +++ "b/zinnnn37/202509/1 BOJ G4 \355\230\270\355\205\224.md" @@ -0,0 +1,60 @@ +```java +import java.io.*; +import java.util.Arrays; +import java.util.StringTokenizer; + +public class BJ_1106_호텔 { + + private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + private static StringTokenizer st; + + private static int C; + private static int N; + private static int[] dp; + private static int[][] cost; + + public static void main(String[] args) throws IOException { + init(); + sol(); + } + + private static void init() throws IOException { + st = new StringTokenizer(br.readLine()); + C = Integer.parseInt(st.nextToken()); + N = Integer.parseInt(st.nextToken()); + + cost = new int[N][2]; + for (int i = 0; i < N; i++) { + st = new StringTokenizer(br.readLine()); + cost[i][0] = Integer.parseInt(st.nextToken()); + cost[i][1] = Integer.parseInt(st.nextToken()); + } + + dp = new int[C + 100]; + Arrays.fill(dp, 987654321); + dp[0] = 0; + } + + private static void sol() throws IOException { + for (int[] c : cost) { + for (int i = c[1]; i < C + 100; i++) { + dp[i] = Math.min(dp[i], dp[i - c[1]] + c[0]); + } + } + bw.write(findMin() + ""); + bw.flush(); + bw.close(); + br.close(); + } + + private static int findMin() { + int ans = dp[C]; + for (int i = C + 1; i < C + 100; i++) { + ans = Math.min(ans, dp[i]); + } + return ans; + } + +} +``` \ No newline at end of file