Submission #14893959


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);

	ll ok = 1e18;
	ll ng = -1;
	while (ok - ng > 1) {
		ll mid = (ok + ng) / 2;
		bool isOk = true;
		/*** 判定 ***/
		ll cnt = 0;
		REP(i, n) {
			ll t = mid / f[i];
			cnt += std::max(0LL, a[i] - t);
		}
		isOk = (cnt <= k);
		/************/
		if (isOk) { ok = mid; } else { ng = mid; }
	}
	cout << ok << endl;

}


Submission Info

Submission Time
Task E - Gluttony
User cutmdo
Language C++ (GCC 9.2.1)
Score 500
Code Size 3875 Byte
Status AC
Exec Time 155 ms
Memory 6380 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 38
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 8 ms 3616 KB
sample_02.txt AC 4 ms 3564 KB
sample_03.txt AC 2 ms 3672 KB
sub1_01.txt AC 133 ms 6276 KB
sub1_02.txt AC 7 ms 3736 KB
sub1_03.txt AC 60 ms 4172 KB
sub1_04.txt AC 23 ms 3652 KB
sub1_05.txt AC 78 ms 4784 KB
sub1_06.txt AC 100 ms 4996 KB
sub1_07.txt AC 7 ms 3596 KB
sub1_08.txt AC 125 ms 5852 KB
sub1_09.txt AC 54 ms 4148 KB
sub1_10.txt AC 77 ms 4800 KB
sub1_11.txt AC 104 ms 5232 KB
sub1_12.txt AC 53 ms 3920 KB
sub1_13.txt AC 30 ms 3716 KB
sub1_14.txt AC 76 ms 4380 KB
sub1_15.txt AC 64 ms 4176 KB
sub1_16.txt AC 93 ms 4884 KB
sub1_17.txt AC 79 ms 4468 KB
sub1_18.txt AC 132 ms 6212 KB
sub1_19.txt AC 130 ms 6356 KB
sub1_20.txt AC 131 ms 6368 KB
sub1_21.txt AC 133 ms 6296 KB
sub1_22.txt AC 136 ms 6340 KB
sub1_23.txt AC 129 ms 6228 KB
sub1_24.txt AC 130 ms 6260 KB
sub1_25.txt AC 129 ms 6284 KB
sub1_26.txt AC 149 ms 6288 KB
sub1_27.txt AC 154 ms 6284 KB
sub1_28.txt AC 155 ms 6208 KB
sub1_29.txt AC 152 ms 6380 KB
sub1_30.txt AC 153 ms 6256 KB
sub1_31.txt AC 155 ms 6260 KB
sub1_32.txt AC 153 ms 6256 KB
sub1_33.txt AC 149 ms 6228 KB
sub1_34.txt AC 9 ms 3640 KB
sub1_35.txt AC 83 ms 4772 KB