結果
問題 | No.2730 Two Types Luggage |
ユーザー |
|
提出日時 | 2024-05-05 03:03:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 308 ms / 2,000 ms |
コード長 | 2,392 bytes |
コンパイル時間 | 2,550 ms |
コンパイル使用メモリ | 202,712 KB |
最終ジャッジ日時 | 2025-02-21 10:57:19 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;void _main();int main() {cin.tie(0);ios::sync_with_stdio(false);_main();return 0;}using ll = long long;using ull = unsigned long long;using ld = long double;using vi = std::vector<int>;using vvi = std::vector<vi>;using vl = std::vector<ll>;using vii = std::vector<pair<int, int> >;using vvl = std::vector<vl>;using vll = std::vector<pair<ll , ll> >;using vd = std::vector<double>;using vvd = std::vector<vd>;using vs = std::vector<std::string>;using vvs = std::vector<vs>;using vb = std::vector<bool>;using vvb = std::vector<vb>;using vc = std::vector<char>;using vvc = std::vector<vc>;using pii = std::pair<int, int>;using pll = std::pair<ll, ll>;using piil = std::pair<pair<int, int>, ll>;using mii = std::map<int, int>;using mll = std::map<ll, ll>;using pql = std::priority_queue<ll>;using pqi = std::priority_queue<int>;using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;using pqii = std::priority_queue<pair<int, int> >;#define pb push_back#define ps push#define eb emplace_back#define is insert#define er erase#define f first#define s second#define lb lower_bound#define ub upper_bound#define sf(i) sizeof(i)#define endl "\n"#define sz(v) ((int)(v).size())#define all(v) (v).begin(), (v).end()#define rep(i, L, R) for(ll i = L;i<=R;i++)#define pcis precisiontemplate<typename T>struct infinity {static constexpr T max=std::numeric_limits<T>::max();static constexpr T min=std::numeric_limits<T>::min();static constexpr T value=std::numeric_limits<T>::max()/2;static constexpr T mvalue=std::numeric_limits<T>::min()/2;};template<typename T>constexpr T INF=infinity<T>::value;constexpr ll lINF=INF<ll>;constexpr int iINF = INF<int>;constexpr ld PI = 3.1415926535897932384626;bool cmp(pll a, pll b) {if (a.f*b.s == b.f*a.s) {return a.f>b.f;}return a.s*b.f > b.s*a.f;}void _main() {ll N, M, W;cin >>N >>M >>W;vll lst;for (ll i = 1; i<=N; i++) {ll A;cin >> A;lst.pb({1, A});}pll A[N+1];for (ll i = 1; i<=M; i++) {cin >> A[i].f;}for (ll i = 1; i<=M; i++) {cin >> A[i].s;}for (ll i = 1; i<=M; i++) {lst.pb(A[i]);}// C/B가 ㅈㄴ 커야함sort(all(lst), cmp);ll MX = 0;ll nokori = W;for (auto [b,c] : lst) {if (b<=nokori) {nokori-=b;MX += c;}if (nokori==0)break;}cout << MX;}