Book Shop

Back to Dynamic Programming

Implementation

C++

                                #include<bits/stdc++.h>
using namespace std;
#define INF 2047483647
#define INFL 9223372036854775807
#define ll long long
#define pii pair<ll,ll>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ull unsigned long long
#define M 1000000007
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define take(x) scanf("%d",&x)
#define DE(x) printf("\ndebug %d\n",x);
#define vout(x) for(int i=0;i<x.size();i++) printf("%d ",x[i]);
#define pie acos(-1)
#define MOD 998244353


int main(){
    FASTIO;
    int n,p;
    cin>>n>>p;
    int dp[p+1] = {0};
    int dpp[p+1] = {0};
    int prices[n],pages[n];
    for(int i=0;i<n;i++) cin>>prices[i];
    for(int i=0;i<n;i++) cin>>pages[i];

    for(int i=0;i<n;i++){
        for(int j=p;j-prices[i]>=0;j--){
            dpp[j-prices[i]] = dp[j]+pages[i];
        }
        for(int j=0;j<=p;j++)
            dp[j] = max(dp[j],dpp[j]);
    }
    cout<<dp[0];

}