Skip to content

Commit 06c47a9

Browse files
authored
Merge pull request #1020 from AlgorithmWithGod/JHLEE325
[20251002] BOJ / G4 / 사탕가게 / 이준희
2 parents d909133 + 84343ca commit 06c47a9

File tree

1 file changed

+43
-0
lines changed

1 file changed

+43
-0
lines changed
Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
7+
public static void main(String[] args) throws IOException {
8+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
9+
StringTokenizer st;
10+
11+
while (true) {
12+
st = new StringTokenizer(br.readLine());
13+
14+
int n = Integer.parseInt(st.nextToken());
15+
int m = (int) (Double.parseDouble(st.nextToken()) * 100.0 + 0.5);
16+
17+
if (n == 0 && m == 0) {
18+
break;
19+
}
20+
21+
int[] dp = new int[m + 1];
22+
23+
int[] cal = new int[n];
24+
int[] price = new int[n];
25+
26+
for (int i = 0; i < n; i++) {
27+
st = new StringTokenizer(br.readLine());
28+
cal[i] = Integer.parseInt(st.nextToken());
29+
price[i] = (int) (Double.parseDouble(st.nextToken()) * 100.0 + 0.5);
30+
}
31+
32+
for (int i = 1; i <= m; i++) {
33+
for (int j = 0; j < n; j++) {
34+
if (i >= price[j]) {
35+
dp[i] = Math.max(dp[i], dp[i - price[j]] + cal[j]);
36+
}
37+
}
38+
}
39+
40+
System.out.println(dp[m]);
41+
}
42+
}
43+
}```

0 commit comments

Comments
 (0)