Submission #8164566


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N; ll K;
int A[201010], F[201010];
//---------------------------------------------------------------------------------------------------
bool check(ll ma) {
	ll cnt = 0;
	rep(i, 0, N) {
		int ok = 0, ng = A[i] + 1;
		while (ok + 1 != ng) {
			int md = (ok + ng) / 2;
			if (1LL * md * F[i] <= ma) ok = md;
			else ng = md;
		}
		cnt += A[i] - ok;
	}
	return cnt <= K;
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> K;
	rep(i, 0, N) cin >> A[i];
	rep(i, 0, N) cin >> F[i];

	sort(A, A + N);
	sort(F, F + N, greater<int>());

	ll ng = -1, ok = infl;
	while (ng + 1 != ok) {
		ll md = (ng + ok) / 2;
		if (check(md)) ok = md;
		else ng = md;
	}
	cout << ok << endl;
}





Submission Info

Submission Time
Task E - Gluttony
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2073 Byte
Status AC
Exec Time 653 ms
Memory 1792 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 486 ms 1792 KB
sub1_02.txt AC 10 ms 256 KB
sub1_03.txt AC 172 ms 768 KB
sub1_04.txt AC 40 ms 384 KB
sub1_05.txt AC 264 ms 1024 KB
sub1_06.txt AC 337 ms 1152 KB
sub1_07.txt AC 8 ms 256 KB
sub1_08.txt AC 461 ms 1536 KB
sub1_09.txt AC 159 ms 768 KB
sub1_10.txt AC 250 ms 1024 KB
sub1_11.txt AC 319 ms 1280 KB
sub1_12.txt AC 158 ms 768 KB
sub1_13.txt AC 74 ms 512 KB
sub1_14.txt AC 249 ms 896 KB
sub1_15.txt AC 215 ms 768 KB
sub1_16.txt AC 376 ms 1152 KB
sub1_17.txt AC 305 ms 1024 KB
sub1_18.txt AC 551 ms 1792 KB
sub1_19.txt AC 608 ms 1792 KB
sub1_20.txt AC 509 ms 1792 KB
sub1_21.txt AC 518 ms 1792 KB
sub1_22.txt AC 625 ms 1792 KB
sub1_23.txt AC 525 ms 1792 KB
sub1_24.txt AC 542 ms 1792 KB
sub1_25.txt AC 623 ms 1792 KB
sub1_26.txt AC 615 ms 1792 KB
sub1_27.txt AC 576 ms 1792 KB
sub1_28.txt AC 650 ms 1792 KB
sub1_29.txt AC 540 ms 1792 KB
sub1_30.txt AC 634 ms 1792 KB
sub1_31.txt AC 555 ms 1792 KB
sub1_32.txt AC 555 ms 1792 KB
sub1_33.txt AC 653 ms 1792 KB
sub1_34.txt AC 9 ms 256 KB
sub1_35.txt AC 285 ms 1024 KB