package algorithm;
import java.util.Scanner;
public class _3_10_01背包问题 {
static int k;
static int C;
static int[] v=new int[100];
static int[] w=new int[100];
static int[][] m=new int[100][100];
static void knapsack(){
for(int i=1;i<=k;i++)
m[i][0]=0;
for(int i=1;i<=C;i++)
m[0][i]=0;
for(int i=1;i<=k;i++){
for(int j=1;j<=C;j++){
if(j<w[i])
m[i][j]=m[i-1][j];
else{
m[i][j]=Math.max(m[i-1][j],v[i]+m[i-1][j-w[i]]);
}
}
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
knapsack();
}
}