forked from Algorithm-with-SSAFY/Algorithm-Study
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBOJ_2294.java
More file actions
Latest commit
60 lines (50 loc) · 1.57 KB
/
Copy pathBOJ_2294.java
File metadata and controls
60 lines (50 loc) · 1.57 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
packagealgorithm_study.day_04_02;
importjava.io.BufferedReader;
importjava.io.IOException;
importjava.io.InputStreamReader;
importjava.util.Arrays;
importjava.util.StringTokenizer;
publicclassBOJ_2294 {
publicstaticvoidmain(String[] args) throwsIOException {
BufferedReaderbr = newBufferedReader(newInputStreamReader(System.in));
StringTokenizerst = newStringTokenizer(br.readLine());
intn = Integer.parseInt(st.nextToken());
intk = Integer.parseInt(st.nextToken());
int[] coin = newint[n + 1];
int[][] dp = newint[n + 1][k + 1];
for (inti = 1; i <= n; i++) {
coin[i] = Integer.parseInt(br.readLine());
}
Arrays.sort(coin);
for (inti = 1; i <= n; i++) {
for (intj = 1; j <= k; j++) {
if(i == 1) {
if(j % coin[i] == 0) dp[i][j] = j / coin[i];
} else {
if(j < coin[i]) {
dp[i][j] = dp[i - 1][j];
} else {
if(j % coin[i] == 0) {
dp[i][j] = j / coin[i];
} else {
if(dp[i - 1][j] == 0 && dp[i][j - coin[i]] + dp[i][coin[i]] == 0) {
dp[i][j] = 0;
} elseif(dp[i - 1][j] == 0 && dp[i][j - coin[i]] != 0) {
dp[i][j] = dp[i][j - coin[i]] + dp[i][coin[i]];
} elseif(dp[i - 1][j] != 0 && dp[i][j - coin[i]] == 0) {
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - coin[i]] + dp[i][coin[i]] );
}
}
}
}
}
}
if(dp[n][k] == 0) {
System.out.println(-1);
} else {
System.out.println(dp[n][k]);
}
}
}