package com.company;
import java.util.concurrent.locks.Lock;
public class Main {
public static void main(String[] args) {
int[] c = new int[0];
int[] w = new int[0];
int v = 0;
int n = 0;
int[][] f;
int dp[][] = new int[0][];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= v; j++) {
if (j < c[i]) {
dp[i][j] = dp[i - 1][j];
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - c[i]] + w[i]);
}
}
}
}
void 简单01背包(int[] c, int[] w, int v, int n) {
int[] dp = new int[0];
for (int i = 1; i <= n; i++) {
for (int j = v; j >= 0; j--) {
if (j < c[i]) break;
dp[j] = Math.max(dp[j], dp[j - c[i]] + w[i]);
}
}
System.out.println(dp[v]);
}
}