Merge pull request matthewsamuel95#71 from 96mohitm/dp-knapsack

Fix matthewsamuel95#62: Added Knapsack in cpp.

Author: matthewsamuel95

DP/Knapsack/KP.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+ 
+int max(int a, int b) { return (a > b)? a : b; }
+ 
+int knapSack(int W, int wt[], int val[], int n)
+{
+   int i, w;
+   int K[n+1][W+1];
+ 
+   // Build table K[][] in bottom up manner
+   for (i = 0; i <= n; i++)
+   {
+       for (w = 0; w <= W; w++)
+       {
+           if (i==0 || w==0)
+               K[i][w] = 0;
+           else if (wt[i-1] <= w)
+                 K[i][w] = max(val[i-1] + K[i-1][w-wt[i-1]],  K[i-1][w]);
+           else
+                 K[i][w] = K[i-1][w];
+       }
+   }
+ 
+   return K[n][W];
+}
+
+int main()
+{
+    int n,W;
+    cin>>n;
+    int val[n],wt[n];
+    for(int i=0;i<n;i++)
+      cin>>val[i];
+    for(int i=0;i<n;i++)
+      cin>>wt[i];
+    cin>>W;
+    printf("%d\n", knapSack(W, wt, val, n));
+    return 0;
+}