Submission #1148319

#TimeUsernameProblemLanguageResultExecution timeMemory
1148319NomioSelf Study (JOI22_ho_t2)C++20
0 / 100
86 ms4936 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; ll a[n], b[n]; for(int i = 0; i < n; i++) { cin >> a[i]; } for(int i = 0; i < n; i++) { cin >> b[i]; a[i] = max(b[i], a[i]); } ll l = 0, r = 1e18; while(l < r) { ll mid = (l + r + 1) / 2; ll cnt = 0; for(int i = 0; i < n; i++) { if(mid <= a[i] * m) cnt += (mid + a[i] - 1) / a[i]; else cnt += (mid - a[i] * m + b[i] - 1) / b[i] + m; } if(cnt <= 1LL * n * m) l = mid; else r = mid - 1; } cout << l << '\n'; return 0; }
#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...