-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlec10_69.cpp
71 lines (58 loc) Β· 1.47 KB
/
lec10_69.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
//{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int f(int ind , int W , vector<int> &val , vector<int> & wt, vector<vector<int>> &dp){
if(ind == 0){
return ((int )(W / wt[0]))* val[0];
}
if(dp[ind][W]!=-1) return dp[ind][W];
int notTake = 0 + f(ind-1 , W , val , wt ,dp);
int take = 0 ;
if(wt[ind]<= W){
take = val[ind] + f(ind , W - wt[ind] , val , wt,dp);
}
return dp[ind][W] = max(take , notTake);
}
int knapSack(vector<int>& val, vector<int>& wt, int w) {
// code here
int n = val.size();
vector<vector<int>> dp( n , vector<int>(w+1 , -1));
return f(n-1 , w , val , wt,dp);
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int W;
cin >> W;
cin.ignore();
string str;
getline(cin, str);
stringstream ss(str);
vector<int> val;
int num;
while (ss >> num) {
val.push_back(num);
}
string str2;
getline(cin, str2);
stringstream ss2(str2);
vector<int> wt;
int num2;
while (ss2 >> num2) {
wt.push_back(num2);
}
Solution ob;
cout << ob.knapSack(val, wt, W) << endl;
cout << "~" << endl;
}
return 0;
}
// } Driver Code Ends