제출 #1319526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319526		Jawad_Akbar_JJ	Self Study (JOI22_ho_t2)	C++20	0 / 100	229 ms	5112 KiB

Main

#include <iostream>

using namespace std;
#define int long long
int a[3<<17], b[3<<17];

signed main(){
	int n, m;
	cin>>n>>m;

	for (int i=1;i<=n;i++)
		cin>>a[i];
	for (int i=1;i<=n;i++)
		cin>>b[i], a[i] = max(a[i], b[i]);

	int l = 0, r = 1e18;
	while (l + 1 < r){
		int mid = (l + r) / 2;

		int req = 0;
		for (int i=1;i<=n;i++){
			if (m * a[i] >= mid)
				req += (mid + a[i] - 1) / a[i];
			else
				req += m + (mid - m * a[i] + b[i] - 1) / b[i];
		}
		if (req <= m * n)
			l = mid;
		else
			r = mid;
	}
	cout<<l<<'\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9