#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef vector<vector<ll>> vll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort(X,X+A); sort(Y,Y+B);
    FOR(i,0,T){
        if (W[i]>=X[A-1] && S[i]>=Y[B-1]) return -1;
    }
    int l = 0, r = T+1;
    vii w(T+A);
    FOR(i,0,T) w[i] = {W[i],S[i]};
    FOR(i,T,T+A) w[i] = {X[i-T],0};
    sort(w.begin(), w.end());
    while (r-l>1){
        int mid = (l+r)/2;
        multiset<int> p;
        FOR(i,0,T+A){
            if (w[i].se > 0){
                p.insert(w[i].se); continue;
            }
            int cnt = 0;
            while (!p.empty() && cnt < mid){
                p.erase(--p.end()); cnt++;
            }
        }
        vii rem;
        for (int u : p) rem.pb({u,1});
        FOR(i,0,B) rem.pb({Y[i],0});
        sort(rem.begin(), rem.end());
        multiset<int> q;
        FOR(i,0,rem.size()){
            if (rem[i].se>0){
                q.insert(rem[i].fi); continue;
            }
            int cnt = 0;
            while (!q.empty() && cnt < mid){
                q.erase((--q.end())); cnt++;
            }
        }
        if (q.empty()){
            r=mid;
        }else{
            l=mid;
        }
    }
    return r;
}