제출 #1270755

#제출 시각아이디문제언어결과실행 시간메모리
1270755tritranminh2808Self Study (JOI22_ho_t2)C++20
0 / 100
37 ms2632 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m;
int a[200005],b[200005];
bool check(int x){
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(a[i]<=b[i]) cnt+=(x+b[i]-1)/b[i];
        else{
            if(a[i]*m>=x) cnt+=(x+a[i]-1)/a[i];
            else{
                int k=x-a[i]*m;
                cnt+=m;
                cnt+=(k*b[i]-1)/b[i];
            }
        }
        if(cnt>n*m) return false;
    }
    return true;
}
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;
    int ans=0;
    while(l<=r){
        int mid=(l+r)/2;
        if(check(mid)){
            ans=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    cout << ans;
    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...