제출 #923408

#제출 시각아이디문제언어결과실행 시간메모리
923408goodspeed0208Self Study (JOI22_ho_t2)C++14
0 / 100
275 ms10932 KiB
#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int>a(n), b(n);
	for (auto &i : a) cin >> i;
	for (auto &i : b) cin >> i;
	
	int l = 0, r = (1e18) + 5, mid;
	while (l + 1 < r) {
		mid = (l + r) / 2;
		int need = 0;
		for (int i = 0 ; i < n ; i++) {
			if (a[i] > b[i]) {
				if (mid > a[i] * m) {
					need += m + (mid - a[i] * m) / b[i];
					if ((mid - a[i] * m ) % b[i] != 0) need++;
				}
				else {
					need += mid / a[i];
					if (mid % a[i] != 0) need++;
				}
			} else {
				need += (mid / b[i]);
				if (mid % b[i] != 0) need++;
			}
		}
		if (need <= n * m) {
			l = mid;
			//cout << l << " " << need << "\n";
		} else {
			r = mid;
		}
	}
	cout << l << "\n";
}





#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...