Submission #58944575

---

Source Code Expand

/// Msaa el 5ra
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5 + 5, A = 26, LG = 19, MOD = (119 << 23) +1, MOD2 = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const ll MAX = 1e15;



void doWork() {
    int n;
    cin >> n;
    vector<int> a(n), b(n-1);

    f(i,0,n)    cin >> a[i];
    f(i,0,n-1)    cin >> b[i];
    sort(all(a));
    sort(all(b));
    int lo = 1, hi = 1000000001;
    while(lo < hi) {
        int md = lo + (hi-lo)/2;
        bool ok = true, taken = false;
        int j = 0;
        f(i,0,n) {
            if(j==n - 1) {
                if(a[i] > md) {
                    ok = false;
                    break;
                }
            }   else {
                if(md <= b[j] && !taken) {
                    taken = true;
                    if(a[i] > md) {
                        ok = false;
                        break;
                    }
                }   else {
                    if(a[i] > b[j]) {
                        ok = false;
                        break;
                    }
                    j += 1;
                }
            }
        }
        if(ok) hi = md;
        else lo = md + 1;
    }

    if(lo == 1000000001)    lo = -1;
    cout << lo << "\n";

}

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
//  cin >> t;
  while (t--) {
    doWork();
  }
}

Submission Info

Judge Result