We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e97b437 commit 48493f9Copy full SHA for 48493f9
suyeun84/202509/19 PGM LV2 완전범죄.md
@@ -0,0 +1,27 @@
1
+```java
2
+import java.util.*;
3
+class Solution {
4
+ static final int INF = 100000;
5
+ public int solution(int[][] info, int n, int m) {
6
+ int size = info.length;
7
+ int[][] dp = new int[size+1][m];
8
+ for (int i = 0; i <= size; i++) {
9
+ Arrays.fill(dp[i], INF);
10
+ }
11
+ dp[0][0] = 0;
12
+ for (int i = 1; i <= size; i++) {
13
+ int a = info[i-1][0];
14
+ int b = info[i-1][1];
15
+ for (int j = 0; j < m; j++) {
16
+ dp[i][j] = Math.min(dp[i][j], dp[i-1][j] + a); // a선택
17
+ if (j + b < m) {
18
+ dp[i][j+b] = Math.min(dp[i][j+b], dp[i-1][j]); // b선택
19
20
21
22
+ int answer = INF;
23
+ for (int j = 0; j < m; j++) answer = Math.min(dp[size][j], answer);
24
+ return answer >= n ? -1 : answer;
25
26
+}
27
+```
0 commit comments