// A Dynamic Programming based solution for 0-1 Knapsack problem

public class Knapsack
{
    
	private static int knapSack(int W, int wt[], int val[], int n)
	{
		int i, w;
	int rv[][] = new int[n+1][W+1];    //rv means return value
	
	// Build table rv[][] in bottom up manner
	for (i = 0; i