Submission #14893927


Source Code Expand

Copy
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================;


signed main() {
	ll n, k;
	cin >> n >> k;
	VL a(n), f(n);
	cin >> a >> f;

	rsort(a);
	sort(f);
	priority_queue<PAIR> q;
	REP(i, n) {
		q.emplace(a[i] * f[i], i);
	}

	REP(_, k) {
		auto [__, i] = q.top();
		if (a[i] == 0) { break; }
		q.pop();
		--a[i];
		q.emplace(a[i] * f[i], i);
	}
	cout << q.top().first << endl;
}


Submission Info

Submission Time
Task E - Gluttony
User cutmdo
Language C++ (GCC 9.2.1)
Score 0
Code Size 3779 Byte
Status TLE
Exec Time 2206 ms
Memory 10576 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 9
TLE × 29
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt, sub1_25.txt, sub1_26.txt, sub1_27.txt, sub1_28.txt, sub1_29.txt, sub1_30.txt, sub1_31.txt, sub1_32.txt, sub1_33.txt, sub1_34.txt, sub1_35.txt
Case Name Status Exec Time Memory
sample_01.txt AC 5 ms 3524 KB
sample_02.txt AC 2 ms 3608 KB
sample_03.txt AC 2 ms 3624 KB
sub1_01.txt AC 72 ms 10572 KB
sub1_02.txt AC 8 ms 3760 KB
sub1_03.txt AC 29 ms 6424 KB
sub1_04.txt AC 8 ms 3960 KB
sub1_05.txt TLE 2205 ms 6720 KB
sub1_06.txt TLE 2205 ms 7188 KB
sub1_07.txt TLE 2205 ms 3288 KB
sub1_08.txt TLE 2206 ms 9884 KB
sub1_09.txt TLE 2205 ms 5228 KB
sub1_10.txt AC 227 ms 6808 KB
sub1_11.txt AC 1171 ms 7220 KB
sub1_12.txt TLE 2205 ms 5096 KB
sub1_13.txt TLE 2205 ms 4136 KB
sub1_14.txt TLE 2205 ms 6612 KB
sub1_15.txt TLE 2205 ms 6340 KB
sub1_16.txt TLE 2205 ms 7108 KB
sub1_17.txt TLE 2205 ms 6724 KB
sub1_18.txt TLE 2206 ms 10504 KB
sub1_19.txt TLE 2206 ms 10524 KB
sub1_20.txt TLE 2206 ms 10384 KB
sub1_21.txt TLE 2206 ms 10528 KB
sub1_22.txt TLE 2206 ms 10412 KB
sub1_23.txt TLE 2206 ms 10416 KB
sub1_24.txt TLE 2206 ms 10432 KB
sub1_25.txt TLE 2206 ms 10524 KB
sub1_26.txt TLE 2206 ms 10504 KB
sub1_27.txt TLE 2206 ms 10504 KB
sub1_28.txt TLE 2206 ms 10576 KB
sub1_29.txt TLE 2206 ms 10532 KB
sub1_30.txt TLE 2206 ms 10464 KB
sub1_31.txt TLE 2206 ms 10504 KB
sub1_32.txt TLE 2206 ms 10480 KB
sub1_33.txt TLE 2206 ms 10572 KB
sub1_34.txt TLE 2205 ms 3340 KB
sub1_35.txt TLE 2205 ms 6784 KB