Submission #1267672

#TimeUsernameProblemLanguageResultExecution timeMemory
1267672SofiatpcSelf Study (JOI22_ho_t2)C++20
0 / 100
48 ms2632 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int MAXN = 3*1e5+5; int a[MAXN], b[MAXN], n,m; bool test(int h){ int qtd = 0; for(int i = 1; i <= n; i++)qtd += (h+a[i]-1)/a[i]; return qtd <= n*m; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; for(int i = 1; i <= n; i++)cin>>a[i]; for(int i = 1; i <= n; i++)cin>>b[i]; int l = 0, r = 1e18; while(l != r){ int mid = (l+r+1)/2; if(test(mid)) l = mid; else r = mid-1; } 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...