Added Solution - GfG to GitHub

Author: DLSireesha

Medium/Minimum cost to fill given weight in a bag/minimum-cost-to-fill-given-weight-in-a-bag.cpp

@@ -0,0 +1,68 @@
+//{ Driver Code Starts
+#include <bits/stdc++.h>
+using namespace std;
+
+class Array {
+  public:
+    template <class T>
+    static void input(vector<T> &A, int n) {
+        for (int i = 0; i < n; i++) {
+            scanf("%d ", &A[i]);
+        }
+    }
+
+    template <class T>
+    static void print(vector<T> &A) {
+        for (int i = 0; i < A.size(); i++) {
+            cout << A[i] << " ";
+        }
+        cout << endl;
+    }
+};
+
+
+// } Driver Code Ends
+
+class Solution {
+  public:
+    int minimumCost(int n, int w, vector<int> &cost) {
+        // code here
+        vector<vector<long long>>dp(n+1,vector<long long>(w+1,0));
+        for(int i=1;i<=w;i++)dp[0][i]=1e9;
+        for(int i=1;i<=n;i++){
+            for(int j=1;j<=w;j++){
+                if(j>=i && cost[i-1]!=-1){
+                    dp[i][j]=min(cost[i-1]+dp[i][j-i],dp[i-1][j]);
+                }
+                else dp[i][j]=dp[i-1][j];
+            }
+        }
+        return dp[n][w]==1e9?-1:dp[n][w];
+    }
+};
+
+
+//{ Driver Code Starts.
+
+int main() {
+    int t;
+    scanf("%d ", &t);
+    while (t--) {
+
+        int n;
+        scanf("%d", &n);
+
+        int w;
+        scanf("%d", &w);
+
+        vector<int> cost(n);
+        Array::input(cost, n);
+
+        Solution obj;
+        int res = obj.minimumCost(n, w, cost);
+
+        cout << res << endl;
+    }
+}
+
+// } Driver Code Ends