-
Notifications
You must be signed in to change notification settings - Fork 0
/
E.cpp
63 lines (50 loc) · 1.03 KB
/
E.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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[101][100001];
ll value[101], weight[101];
ll helper(int i, int n, ll val)
{
if (val == 0) {
return 0;
}
if (val < 0 || i >= n) {
return 1e15;
}
if (dp[i][val] != -1) {
return dp[i][val];
}
return dp[i][val] = min(weight[i] + helper(i + 1, n, val - value[i]), helper(i + 1, n, val));
}
void solve()
{
ll n, W;
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
// dp[i][j] = max profit gained till (1...i) items of having value of j s.t. total weight is less than capacity
memset(dp, -1, sizeof(dp));
ll ans = 0;
for (int i = 1; i <= 100000; i++) {
ll wt = helper(0, n, i);
if (wt <= W) {
ans = i;
}
}
cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("Error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}