value[4] = 18.
Proceed similarly for higher weights. For the total capacity of 48, the maximum value is 30 + 2 × 9 = 48.
Code

[{"language":"C++","code":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nclass Solution {\npublic:\n    int unboundedKnapsack(int capacity, vector<int>& weights, vector<int>& values, int itemCount) {\n        // Initialize DP array\n        vector<int> dp(capacity + 1, 0);\n\n        // Fill DP array\n        for (int w = 1; w <= capacity; ++w) {\n            for (int i = 0; i < itemCount; ++i) {\n                if (weights[i] <= w) {\n                    dp[w] = max(dp[w], dp[w - weights[i]] + values[i]);\n                }\n            }\n        }\n\n        return dp[capacity];\n    }\n};\n\n// Example usage\nint main() {\n    Solution solution;\n    vector<int> weights = {6, 3, 4, 2};\n    vector<int> values = {30, 14, 16, 9};\n    int capacity = 48;\n    cout << \"Maximum value: \" << solution.unboundedKnapsack(capacity, weights, values, weights.size()) << endl;\n    return 0;\n}","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">#include</span><span style=\"color:#032F62;--shiki-dark:#9ECBFF\"> &#x3C;iostream></span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">#include</span><span style=\"color:#032F62;--shiki-dark:#9ECBFF\"> &#x3C;vector></span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">#include</span><span style=\"color:#032F62;--shiki-dark:#9ECBFF\"> &#x3C;algorithm></span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">using</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> namespace</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> std</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">;</span></span>\n<span class=\"line\"></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public:</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> unboundedKnapsack</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> capacity</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">vector</span><span style=\
Related Tags

Continue Practicing
