Merge pull request matthewsamuel95#318 from RITESHMOHAPATRA/patch-1

Create 0-1_Knapsackproblem.cpp

Author: matthewsamuel95

Greedy/Knapsack/0-1_Knapsackproblem.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+using namespace std;
+
+int knapSack(int W, int *wt, int *val, int n) {
+    int K[n+1][W+1];
+    for (int i = 0; i <= n; i++) {
+        for (int j = 0; j <= W; j++) {
+            if (i==0 || j==0)
+                K[i][j] = 0;
+            else if (wt[i-1] <= j)
+                K[i][j] = max(val[i-1] + K[i-1][j-wt[i-1]],  K[i-1][j]);
+            else
+                K[i][j] = K[i-1][j];
+        }
+    }
+    return K[n][W];
+}
+
+
+int main() {
+    int n;
+    cout << "\nNumber of items\t:\t";
+    cin >> n;
+    int val[n] , wt[n];
+    for ( int i = 0 ;i < n;i++) {
+        cout << "\nEnter weight and its value for " << (i+1) << "\n";
+        cin >> wt[i];
+        cin >> val[i];
+    }
+    int w;
+    cout << "\nEnter capacity of knapsack\t:\t";
+    cin >> w;
+    cout << "\nThe Result is\t:\t" << knapSack(w, wt, val, n) << endl;
+    return 0;
+}