結果
問題 | No.2730 Two Types Luggage |
ユーザー |
![]() |
提出日時 | 2024-04-19 21:32:58 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 572 ms / 2,000 ms |
コード長 | 2,135 bytes |
コンパイル時間 | 1,948 ms |
コンパイル使用メモリ | 173,660 KB |
実行使用メモリ | 18,816 KB |
最終ジャッジ日時 | 2024-10-11 14:11:24 |
合計ジャッジ時間 | 13,628 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define CPP_STR(x) CPP_STR_I(x)#define CPP_CAT(x, y) CPP_CAT_I(x, y)#define CPP_STR_I(args...) #args#define CPP_CAT_I(x, y) x##y#define ASSERT(expr...) assert((expr))using i8 = int8_t;using u8 = uint8_t;using i16 = int16_t;using u16 = uint16_t;using i32 = int32_t;using u32 = uint32_t;using i64 = int64_t;using u64 = uint64_t;using f32 = float;using f64 = double;// }}}constexpr i64 INF = 1'010'000'000'000'000'017LL;constexpr i64 MOD = 998244353LL;constexpr f64 EPS = 1e-12;constexpr f64 PI = 3.14159265358979323846;#define M5 100007#define M9 1000000000#define F first#define S second// util {{{#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)#define REP(i, n) FOR(i, 0, n)#define all(x) (x).begin(), (x).end()#define ll long long int#define VI vector<ll>#define VVI vector<VI>#define ISD true#define debug(x) \if (ISD) \cout << #x << ": " << x << endltemplate <typename T, typename U, typename Comp = less<>>bool chmax(T &xmax, const U &x, Comp comp = {}){if (comp(xmax, x)){xmax = x;return true;}return false;}template <typename T, typename U, typename Comp = less<>>bool chmin(T &xmin, const U &x, Comp comp = {}){if (comp(x, xmin)){xmin = x;return true;}return false;}int main(){ll N, M, W;cin >> N >> M >> W;vector<ll> A(N);REP(i, N)cin >> A[i];vector<ll> B(M), C(M);REP(i, M)cin >> B[i];REP(i, M)cin >> C[i];sort(A.rbegin(), A.rend());vector<ll> S(N + 1);REP(i, N){S[i + 1] = S[i] + A[i];}ll ans = 0;REP(bit, (1 << M)){ll WS = 0;ll PS = 0;REP(i, M){if (((bit >> i) & 1)){WS += B[i];PS += C[i];}}if (WS > W){continue;}ll s = min(N, W - WS);chmax(ans, PS + S[s]);}cout << ans << endl;}