-
Notifications
You must be signed in to change notification settings - Fork 0
/
7. Book Shop.cpp
62 lines (56 loc) · 1.75 KB
/
7. Book Shop.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
#include "iostream"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<string> vs;
typedef set<ll> sl;
typedef map<string, ll> msl;
typedef map<ll, ll> mll;
typedef unordered_map<ll, ll> umll;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(NULL)
#define PB push_back
#define MP make_pair
#define LB lower_bound
#define UB upper_bound
#define F first
#define S second
#define I iterator
#define REP(i,a,b) for (ll i = a; i < b; i++)
#define REPR(i,a,b) for (ll i = a; i > b; i--)
#define REPJ(i,a,b,j) for (ll i = a; i < b; i+=j)
#define REPIT(it,o) for (auto it = o.begin(); it != o.end(); it++)
#define REPITR(it,o) for (auto it = o.rbegin(); it != o.rend(); it++)
#define ALL(a) a.begin(),a.end()
#define ALLR(a) a.rbegin(),a.rend()
bool c(pll a, pll b){
if ((ld)a.F/(ld)a.S == (ld)b.F/(ld)b.S) return a.F < b.F;
return (ld)a.F/(ld)a.S > (ld)b.F/(ld)b.S;
}
int main() {
fastio();
ll n,x; cin >> n >> x;
vl pr (n,0); REP(i,0,n){ cin >> pr[i]; }
vl pa (n,0); REP(i,0,n){ cin >> pa[i]; }
vl ans (x+1,0);
REP(i,0,n){
REPR(j,x,pr[i]-1){
ans[j] = max(ans[j], (pa[i] + ans[j-pr[i]]));
}
}
cout << ans[x];
}
// - initial approach
// greedy - sort a array of pair of price and pages by pages/price desc , loop over and count from the first ele
// wa
// second approach
// dp - loop from 1 to x and update the max value by looping through each book as max(ans[j], (pa[i] + ans[j-pr[i]]));
// wa
// third approach
// dp - for every book set the max value from x to pr[i] considering we can either include the book or not
// ac