Unbounded Knapsack

package pep.Day84;

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

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

        int maxCapacity = 7;
        int[] dp = new int[maxCapacity + 1];

        for (int cap = 0; cap <= maxCapacity; cap++) {
            int max = 0;
            for (int i = 0; i < values.length; i++) {
                int val = values[i];
                int wt = weight[i];

                // check item
                if (cap >= wt) {
                    int amt = val + dp[cap - wt];
                    max = Math.max(max, amt);

                }
            }

            dp[cap] = max;
        }

        System.out.println(dp[maxCapacity]);
    }
}