oj.uz

Submission #735674

# Submission time Handle Problem Language Result Execution time Memory
735674 2023-05-04T12:52:07 Z GrindMachine Kralj (COCI16_kralj) C++17
56 / 140
 242 ms 25096 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> p(n + 5);
    rep1(i, n) cin >> p[i];

    vector<ll> a(n + 5), b(n + 5);
    rep1(i, n) cin >> a[i];
    rep1(i, n) cin >> b[i];

    sort(a.begin() + 1, a.begin() + n + 1);
    sort(b.begin() + 1, b.begin() + n + 1);

    auto ok = [&](ll k) {
        ll j = n - k + 1;
        rep1(i, k) {
            if (b[j] < a[i]) {
                return false;
            }
            j++;
        }

        return true;
    };

    ll l = 0, r = n;
    ll ans = -1;

    while (l <= r) {
        ll mid = (l + r) >> 1;
        if (ok(mid)) {
            ans = mid;
            l = mid + 1;
        }
        else {
            r = mid - 1;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
56.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 18376 KB Output is correct
2 Correct 204 ms 17436 KB Output is correct
3 Correct 198 ms 21620 KB Output is correct
4 Correct 211 ms 21712 KB Output is correct
5 Incorrect 197 ms 22604 KB Output isn't correct
6 Incorrect 206 ms 21892 KB Output isn't correct
7 Incorrect 234 ms 23628 KB Output isn't correct
8 Incorrect 217 ms 21176 KB Output isn't correct
9 Incorrect 242 ms 25096 KB Output isn't correct
10 Incorrect 232 ms 24012 KB Output isn't correct