#pragma region Macros #include #include #if defined(LOCAL) || defined(_DEBUG) #include "debug.hpp" #else #define O(...) #define START() #define STOP() #define MEMORY() #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); ibool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; } templatebool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; } #define vec vector #define umap unordered_map #define uset unordered_set using ll = long long; using ld = long double; using P = pair; using Tup = tuple; using vl = vec; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits::max()/2-1; template istream &operator>>(istream &stream, vec& o){REP(i, o.size())stream >> o[i];return stream;} template istream &operator>>(istream &stream, pair& o){cin >> o.fi >> o.se; return stream;} namespace myinput { void input() {} template void input(T&& o, Ts&&... args){cin >> o;input(forward(args)...);} void assign_vl(size_t siz) {}; template void assign_vl(size_t siz, T&& o, Ts&&... args){o.resize(siz);assign_vl(siz, forward(args)...);} void input_horizon_sub(size_t index) {}; template void input_horizon_sub(size_t index, T&& o, Ts&&... args) {cin>>o[index];input_horizon_sub(index, forward(args)...);} template void input_horizon(size_t siz, Ts&&... args){REP(i, siz) input_horizon_sub(i, forward(args)...);} } #define _I(T, ...) ;myinput::input(__VA_ARGS__); #define I(T, ...) ;T __VA_ARGS__;_I(T, __VA_ARGS__); #define _Iv(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input(__VA_ARGS__); #define Iv(T, siz, ...) ;vec __VA_ARGS__;_Iv(T, siz, __VA_ARGS__); #define _Ih(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input_horizon(siz, __VA_ARGS__); #define Ih(T, siz, ...) ;vec __VA_ARGS__;_Ih(T, siz, __VA_ARGS__); #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); MEMORY(); return 0; } ll n, m, w; vl a, b, c, d; ll dp[500+1][128][128]; ll rec(ll noww, ll usedn, ll usedm) { if(noww < 0 || noww > w) return -INF; ll &res = dp[noww][usedn][usedm]; if(~res) return res; res = 0; REP(i, n) { ll msk = 1 << i; if((usedn & msk) == 0) { chmax(res, rec(noww+a[i], usedn | msk, usedm)+b[i]); } } REP(i, m) { ll msk = 1 << i; if((usedm & msk) == 0) { chmax(res, rec(noww-c[i], usedn, usedm | msk)-d[i]); } } return res; } void Main(){ memset(dp, -1, sizeof(dp)); _I(ll, n, m, w); _Iv(ll, n, a, b); _Iv(ll, m, c, d); cout << rec(0, 0, 0) << el; }