제출 #1319581

#제출 시각아이디문제언어결과실행 시간메모리
1319581MuhammadSaramSelf Study (JOI22_ho_t2)C++20
0 / 100
229 ms5088 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n,m; cin>>n>>m; int 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(a[i],b[i]); int s=0, e=1e18; while (s+1<e) { int mid=(s+e)/2,su=0; for (int i=0;i<n;i++) { if (a[i]*m>=mid) su+=m-(mid+a[i]-1)/a[i]; else su-=(mid-a[i]*m+b[i]-1)/b[i]; } if (su>=0) s=mid; else e=mid; } cout<<s<<endl; 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...