blob: 97e89aa2704c1717e0e6f12d62ca6e0fb33584a7 (
plain)
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
|
import java.util.Scanner;
public class Knapsack {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int W, n;
W = scanner.nextInt();
n = scanner.nextInt();
int[] w = new int[n];
for (int i = 0; i < n; i++) {
w[i] = scanner.nextInt();
}
System.out.println(optimalWeight(W, w));
}
public static int optimalWeight(int W, int[] w2) {
int j = w2.length;
int[][] value = new int[W + 1][j + 1];
for (int i = 0; i < j + 1; i++) {
for (int w = 0; w < W + 1; w++) {
if (i == 0 || w == 0) {
value[w][i] = 0;
continue;
}
value[w][i] = value[w][i - 1];
if (w2[i - 1] <= w) {
int val = value[w - w2[i - 1]][i - 1] + w2[i - 1];
if (value[w][i] < val) {
value[w][i] = val;
}
}
}
}
return value[W][j];
}
}
|
