-
Notifications
You must be signed in to change notification settings - Fork 0
/
OrdinaryKnapsack.java
34 lines (30 loc) · 1006 Bytes
/
OrdinaryKnapsack.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
package dynamicProgramming;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class OrdinaryKnapsack {
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 K = Integer.parseInt(st.nextToken());
int W[] = new int[N + 1];
int V[] = new int[N + 1];
int d[][] = new int[N + 1][K + 1];
for (int i = 1; i <= N; i++) {
st = new StringTokenizer(br.readLine());
W[i] = Integer.parseInt(st.nextToken());
V[i] = Integer.parseInt(st.nextToken());
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if(j < W[i])
d[i][j] = d[i - 1][j];
else
d[i][j] = Math.max(d[i - 1][j], d[i - 1][j - W[i]] + V[i]);
}
}
System.out.println(d[N][K]);
}
}