CSES Solutions
#1158Dynamic Programming

Book Shop

View on CSES

Solution

1158-Book_Shop.cpp
1#include<bits/stdc++.h>
2using namespace std;
3#define int long long
4signed main(){
5  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
6  int n,x; cin>>n>>x;
7  int p[n],c[n];
8  for(int i=0;i<n;++i) cin>>p[i];
9  for(int i=0;i<n;++i) cin>>c[i];
10  int dp[x+1]{};
11  dp[0]=0;
12  for(int i=0;i<n;++i){
13    for(int j=x;j>=p[i];--j){
14      dp[j]=max(dp[j],dp[j-p[i]]+c[i]);
15    }
16  }
17  cout<<*max_element(dp,dp+x+1)<<'\n';
18  return 0;
19}

Editorial not yet generated for this problem. Run the editorial generation script to add hints and detailed explanations.