Zero One Knapsack

package pep.Day83;

public class Zero_One_Knapsack {
    public static void main(String[] args) {

        int[] values = {15, 14, 10, 45, 30};
        int n = values.length;
        int[] weight = {2, 5, 1, 3, 4};

        int maxCap = 7;

        int[][] dp = new int[n + 1][maxCap + 1];

        for (int i = 1; i <= n; i++) {

            for (int cap = 1; cap <= maxCap; cap++) {
                int val = values[i - 1];
                int wt = weight[i - 1];

                if (cap >= wt) {
                    // INCLUDE WALA CASE: jisme weight<= capacity se

                    int include = val + dp[i - 1][cap - wt];

                    int exclude = dp[i - 1][cap];
                    dp[i][cap] = Math.max(include, exclude);
                } else {
                    // EXCLUDE WALA CASE

                    dp[i][cap] = dp[i - 1][cap];
                }
            }
        }

        System.out.println(dp[n][maxCap]);
    }
}