-
Notifications
You must be signed in to change notification settings - Fork 0
/
App.java
75 lines (57 loc) · 2.18 KB
/
App.java
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class App {
private static int[] memoryArr;
private static int[] costArr;
private static int[][] resultArr;
private static int minCost = Integer.MAX_VALUE;
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine(), " ");
int length = Integer.parseInt(st.nextToken());
int memory = Integer.parseInt(st.nextToken());
initMemoryArr(length);
initCostArr(length);
initResultArr(length);
st = new StringTokenizer(br.readLine(), " ");
mkMemoryArr(st);
st = new StringTokenizer(br.readLine(), " ");
mkCostArr(st);
mkResultArr(memory);
System.out.println(minCost);
}
private static void initMemoryArr(int length) {
memoryArr = new int[length];
}
private static void initCostArr(int length) {
costArr = new int[length];
}
private static void initResultArr(int height) {
resultArr = new int[height][10_001];
}
private static void mkMemoryArr(StringTokenizer st) {
int index = 0;
for(;st.hasMoreTokens();) {
memoryArr[index++] = Integer.parseInt(st.nextToken());
}
}
private static void mkCostArr(StringTokenizer st) {
int index = 0;
for(;st.hasMoreTokens();) {
costArr[index++] = Integer.parseInt(st.nextToken());
}
}
private static void mkResultArr(int reqMemory) {
for(int i = 0; i < resultArr.length; i++) {
int memory = memoryArr[i];
int cost = costArr[i];
for(int j = 0; j < resultArr[0].length; j++) {
if(i == 0 && j >= cost) resultArr[i][j] = memory;
if(i != 0 && j >= cost) resultArr[i][j] = Math.max(resultArr[i-1][j-cost] + memory, resultArr[i-1][j]);
if(i != 0 && j < cost) resultArr[i][j] = resultArr[i-1][j];
if(resultArr[i][j] >= reqMemory) minCost = Math.min(minCost, j);
}
}
}
}