#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define PAIR std::pair #define IN(a, x, b) (a<=x && x<=b) #define SHOW(d) {std::cout << #d << "\t:" << d << "\n";} #define SHOWVECTOR(v) {std::cout << #v << "\t:";for(const auto& i : v){std::cout << i << " ";}std::cout << "\n";} #define SHOWVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout << j << " ";}std::cout << "\n";}} #define SHOWPAIRVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout<<'('<(end-start).count();std::cerr<<"[Time:"< tmp(a);std::cout << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";} //#define int ll using ll = long long; constexpr int INFINT = 1 << 30; constexpr ll INFLL = 1LL << 60; constexpr double EPS = 0.0000000001; constexpr int MOD = 1000000007; // dp[pos][時間] = その時の満足度の最大値 int dp[150][10505]; int main() { INIT; VAR(int, t, n); VEC(int, c_in, n); VEC(int, v_in, n); std::vector c, v; REP(i, n) { while (v_in[i] > 0) { c.emplace_back(c_in[i]); v.emplace_back(v_in[i]); v_in[i] /= 2; } } REP(i, c.size()) REP(j, t) { dp[i + 1][j + c[i]] = std::max(dp[i][j + c[i]], dp[i][j] + v[i]); } int ans = 0; REP(j, t+1) { ans = std::max(ans, dp[c.size()][j]); } OUT(ans)BR; return 0; }