Merge pull request #146 from AlgoLeadMe/6-wonjunYou

6-wonjunYou

Author: wonjunYou

wonjunYou/다이나믹 프로그래밍/BOJ_호텔.java

@@ -0,0 +1,37 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int c = Integer.parseInt(st.nextToken());
+        int n = Integer.parseInt(st.nextToken());
+
+        int[] dp = new int[c + 100];
+        Arrays.fill(dp, Integer.MAX_VALUE);
+        dp[0] = 0;
+
+        for (int i = 0; i < n; i++) {
+            st = new StringTokenizer(br.readLine());
+            int cost = Integer.parseInt(st.nextToken());
+            int customer = Integer.parseInt(st.nextToken());
+
+            for (int j = customer; j < c + 100; j++) {
+                if (dp[j - customer] != Integer.MAX_VALUE)
+                    dp[j] = Math.min(dp[j], cost + dp[j - customer]);
+            }
+        }
+
+        int answer = Integer.MAX_VALUE;
+        for (int i = c; i < c + 100; i++) {
+            answer = Math.min(answer, dp[i]);
+        }
+        System.out.println(answer);
+    }
+}