Submission #528771

#	Time	Username	Problem	Language	Result	Execution time	Memory
528771		FireGhost1301	Self Study (JOI22_ho_t2)	C++11	0 / 100	301 ms	7108 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 3;
int n, m, a[N], b[N];

bool check(long long d) {
    long long sum = 0;
    for (int i = 1; i <= n; ++i) {
        if (1LL * a[i] * m >= d) sum += (d + a[i] - 1) / a[i];
        else sum += m + (d - 1LL * a[i] * m + b[i] - 1) / b[i];
    }
    return sum <= 1LL * n * m;
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n; ++i)
        cin >> b[i], a[i] = max(a[i], b[i]);
    long long l = 1, r = 1e18, ans, mid;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (check(mid)) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9