-
Notifications
You must be signed in to change notification settings - Fork 1
/
D.cpp
52 lines (41 loc) · 910 Bytes
/
D.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
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
vector< vector<ll int> > dp;
ll int a[105],b[105];
ll int n,w;
ll int knapsack(int pos,ll int w)
{
if(w<=0)
return 0;
if(pos>=n)
return 0;
if(dp[pos][w]!=-1)
return dp[pos][w];
if(w<a[pos])
return dp[pos][w]=knapsack(pos+1,w);
if(pos==n-1)
return dp[pos][w]=b[pos];
return dp[pos][w]=max(knapsack(pos+1,w),knapsack(pos+1,w-a[pos])+b[pos]);
}
int main()
{ quick;
cin>>n>>w;
fab(0,n,i)
cin>>a[i]>>b[i];
dp=vector< vector<ll int> > (n,vector<ll int>(w+1,-1));
knapsack(0,w);
cout<<dp[0][w]<<endl;
return 0;
}