// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010
int32_t main() {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n, m; cin >> n >> m;
vector<int> c(n), w(n);
rep(i, 0, n) cin >> c[i];
rep(i, 0, n) cin >> w[i];
vector<int> dp(m+1, -INF);
dp[0] = 0;
rep(i, 0, n) {
for (int j = m; j >= 0; --j) {
if (j-c[i] >= 0) {
cmax(dp[j], dp[j-c[i]] + w[i]);
}
}
}
cout << *max_element(dp.begin(), dp.end()) << endl;
return 0;
}
Yo, sv388sv288, huh? Heard some buzz about them. Seems like they’ve got some interesting stuff going on. Might have to check ’em out myself after hearing the hype. See what they’re all about at: sv388sv288
Need my fix of ‘trực tiếp gà chọi c1’! Hoping for some good live fights. Fingers crossed this link works! trực tiếp gà chọi c1.
Guys, the jiliwinapplogin process is smooth as silk! No hassle at all. Makes it easy to jump in and play. Sulit!