diff --git a/Knapsack.c++ b/Knapsack.c++
new file mode 100644
index 0000000..ad87bd4
--- /dev/null
+++ b/Knapsack.c++
@@ -0,0 +1,46 @@
+/*
+Question-
+Given weights and values of n items, put these items in a knapsack of 
+capacity W to get the maximum total value in the knapsack. 
+In other words, given two integer arrays val[0..n-1] and wt[0..n-1] 
+which represent values and weights associated with n items respectively.
+Also given an integer W which represents knapsack capacity, 
+find out the maximum value subset of val[] such that sum of the 
+weights of this subset is smaller than or equal to W. 
+You cannot break an item, either pick the complete item or 
+don’t pick it (0-1 property).
+*/
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int knapsack(int W, vector<int> &wt, vector<int> &val, int n){
+    vector<vector<int>> K(n+1,vector<int>(W+1));
+    for(int i=0;i<=n;i++){
+        for(int 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(){
+    vector<int> val = { 60, 100, 120 };
+    vector<int> wt = { 10, 20, 30 };
+    int W = 50;
+    int n = sizeof(val) / sizeof(val[0]);
+     
+    cout << knapsack(W, wt, val, n);
+    return 0;
+}