Create BJ_7579_앱.java

Author: kn9012

250414/BJ_7579_앱.java

@@ -0,0 +1,53 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+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 N = Integer.parseInt(st.nextToken());
+		int M = Integer.parseInt(st.nextToken());
+		
+		int[] memory = new int[N + 1];
+		int[] cost = new int[N + 1];
+		
+		// 차지하는 메모리 저장
+		st = new StringTokenizer(br.readLine());
+		for (int i = 1; i <= N; i++) {
+			memory[i] = Integer.parseInt(st.nextToken());
+		}
+		
+		int costSum = 0;
+		
+		// 비용 저장
+		st = new StringTokenizer(br.readLine());
+		for (int i = 1; i <= N; i++) {
+			cost[i] = Integer.parseInt(st.nextToken());
+			costSum += cost[i];
+		}
+		
+		int[][] dp = new int[N + 1][costSum + 1];
+		
+		int answer = Integer.MAX_VALUE;
+		
+		for (int i = 0; i <= N; i++) {
+			for (int j = 0; j <= costSum; j++) {
+				if (i == 0) {
+					if (j >= cost[i]) dp[i][j] = memory[i];
+				} else {
+					if (j >= cost[i]) dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - cost[i]] + memory[i]);
+					else dp[i][j] = dp[i - 1][j];
+				}
+				
+				if (dp[i][j] >= M) answer = Math.min(answer, j);
+			}
+			
+			
+		}
+		
+		System.out.println(answer);
+	}
+}