제출 #1164283

#제출 시각아이디문제언어결과실행 시간메모리
1164283ChottuFSelf Study (JOI22_ho_t2)C++20
0 / 100
211 ms5172 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 lo = 0;
    int hi = 1e18;
    int ans = lo;
    int mid;
    while (lo <= hi){
        mid = (lo+hi)/2;
        //check mid
        int net = 0;
        for (int i = 0; i<n; i++){
            int ss = (mid+a[i]-1)/a[i];
            if (ss <= m){
                net += m-ss;
            }
            else{
                int cpy = mid;
                cpy -= m * a[i];
                net -= (cpy+b[i]-1)/b[i];
            }
        }
        if (net >= 0){
            ans = max(ans, mid);
            lo = mid + 1;
        }
        else{
            hi = 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...