import java.util.*; public class Solution { public int knapsack (int v, int n, int[][] vw) { // write code here int[] dp = new int[v + 1]; dp[0]= 0; for (int i = 0; i < n; i++){ for (int j = v; j >= vw[i][0]; j--){ if (j >= vw[i][0]){ dp[j] = Math.max(dp[j], dp[j - vw[i][0]] + vw[i][1]); } } } return dp[v]; } }