cp/cses/dynamic-programming/book-shop.cc
2025-04-20 12:15:26 -04:00

93 lines
1.7 KiB
C++

#include <bits/stdc++.h> // {{{
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using d64 = double;
using d128 = long double;
template <typename T>
using vec = std::vector<T>;
template <typename T, size_t N>
using arr = std::array<T, N>;
template <typename T1, typename T2>
using pai = std::pair<T1, T2>;
template <typename T>
constexpr T MIN = std::numeric_limits<T>::min();
template <typename T>
constexpr T MAX = std::numeric_limits<T>::max();
template <typename T>
[[nodiscard]] static T sc(auto&& x) {
return static_cast<T>(x);
}
template <typename T>
[[nodiscard]] static T sz(auto&& x) {
return static_cast<T>(x.size());
}
static void NO() {
std::cout << "NO\n";
}
static void YES() {
std::cout << "YES\n";
}
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
#define db(...) std::print(__VA_ARGS__)
#define dbln(...) std::println(__VA_ARGS__)
#else
#define db(...)
#define dbln(...)
#endif
// }}}
void solve() {
u64 n, x;
cin >> n >> x;
vec<u64> pages(n), prices(n);
for (auto& e : prices)
cin >> e;
for (auto& e : pages)
cin >> e;
vec<u64> dp(x + 1, 0);
for (u64 i = 1; i <= n; ++i) {
for (u64 j = x; j >= 1; --j) {
if (j >= prices[i - 1])
dp[j] = max(dp[j], dp[j - prices[i - 1]] + pages[i - 1]);
}
}
cout << dp[x] << '\n';
}
int main() { // {{{
cin.tie(nullptr)->sync_with_stdio(false);
cin.exceptions(cin.failbit);
int tc = 1;
// cin >> tc;
for (int t = 0; t < tc; ++t) {
solve();
}
return 0;
}
// }}}