codeforces-practice/1443c.cpp at main · vishnupsatish/codeforces-practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>

using namespace std;

// Idea: binary search for answer

#define ll long long


void solve() {
    int n;
    cin >> n;

    vector<ll> a(n + 2), b(n + 2);

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }

    auto check = [&](ll time) -> bool {
        ll su = 0;

        for (int i = 1; i <= n; i++) {
            if (a[i] > time) {
                su += b[i];
            }
        }

        return su <= time;
    };

    ll l = 0, r = 1e9;

    while (l < r) {
        ll mid = (l + r) / 2;

        if (check(mid)) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }

    cout << l << '\n';
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }
}