Unbounded Knapsack.cpp

Author: KrishnaRA03

Unbounded Knapsack.cpp

@@ -0,0 +1,37 @@
+/* Unbounded Knapsack Problem */
+
+#include <bits/stdc++.h>
+using namespace std;
+#define int long long int
+#define fast                    \
+    cin.sync_with_stdio(false); \
+    cin.tie(NULL);              \
+    cout.tie(NULL);
+
+int dp[1001][10001];
+
+int knapsack(int n, int wt[], int val[], int W)
+{
+    if (n == 0 || W == 0)
+        return 0;
+
+    if (dp[n][W] != -1)
+        return dp[n][W];
+    if (wt[n - 1] <= W)
+        return dp[n][W] = max(val[n - 1] + knapsack(n, wt, val, W - wt[n - 1]), knapsack(n - 1, wt, val, W));
+    else
+        return dp[n][W] = knapsack(n - 1, wt, val, W);
+}
+signed main()
+{
+    fast;
+    int n = 4;
+    int wt[4] = {1, 3, 4, 5};
+    int val[4] = {10, 40, 50, 70};
+
+    int W = 8;
+    //memonization
+    memset(dp, -1, sizeof(dp));
+    cout << knapsack(n, wt, val, W);
+    return 0;
+}