Submission #8166425


Source Code Expand

Copy
#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 <random>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.h"
#else
#define dump(...)
template<class T>inline auto d_val(T a, T b) { return a; }
#endif

/* (=^o^=) */
#define int ll

/* 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 */
#define SORT(x) do{sort(ALL(x));}while(false)
#define RSORT(x) do{sort((x).rbegin(),(x).rend());}while(false)
#define UNIQUE(v) do{v.erase( unique(v.begin(), v.end()), v.end() );}while(false)
#define MAX(x,y) do{x = std::max(x,y);}while(false)
#define MIN(x,y) do{x = std::min(x,y);}while(false)
#define BR do{cout<<"\n";}while(false)

/* 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::sort;
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;

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

/* 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; }

//=============================================================================================

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

	SORT(a); RSORT(f);

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

Submission Info

Submission Time
Task E - Gluttony
User cutmdo
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3487 Byte
Status AC
Exec Time 146 ms
Memory 3328 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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sub1_01.txt AC 94 ms 3328 KB
sub1_02.txt AC 3 ms 384 KB
sub1_03.txt AC 34 ms 1408 KB
sub1_04.txt AC 9 ms 512 KB
sub1_05.txt AC 66 ms 1664 KB
sub1_06.txt AC 84 ms 2176 KB
sub1_07.txt AC 3 ms 256 KB
sub1_08.txt AC 116 ms 2816 KB
sub1_09.txt AC 27 ms 1152 KB
sub1_10.txt AC 36 ms 1792 KB
sub1_11.txt AC 47 ms 2176 KB
sub1_12.txt AC 39 ms 1152 KB
sub1_13.txt AC 19 ms 640 KB
sub1_14.txt AC 63 ms 1664 KB
sub1_15.txt AC 39 ms 1408 KB
sub1_16.txt AC 79 ms 2048 KB
sub1_17.txt AC 60 ms 1664 KB
sub1_18.txt AC 126 ms 3328 KB
sub1_19.txt AC 101 ms 3328 KB
sub1_20.txt AC 64 ms 3328 KB
sub1_21.txt AC 72 ms 3328 KB
sub1_22.txt AC 110 ms 3328 KB
sub1_23.txt AC 123 ms 3328 KB
sub1_24.txt AC 79 ms 3328 KB
sub1_25.txt AC 120 ms 3328 KB
sub1_26.txt AC 120 ms 3328 KB
sub1_27.txt AC 146 ms 3328 KB
sub1_28.txt AC 135 ms 3328 KB
sub1_29.txt AC 92 ms 3328 KB
sub1_30.txt AC 126 ms 3328 KB
sub1_31.txt AC 101 ms 3328 KB
sub1_32.txt AC 145 ms 3328 KB
sub1_33.txt AC 137 ms 3328 KB
sub1_34.txt AC 3 ms 256 KB
sub1_35.txt AC 52 ms 1792 KB