#include <bits/stdc++.h>
#include"robots.h"
using namespace std;
#define f first
#define s second
int putaway(int A, int B, int t, int x[], int y[], int w[], int s[]) {
int n = A, m = B;
sort(x, x + n);
sort(y, y + m);
for (int i = 0;i < t;i++) {
if (w[i] >= x[n - 1] && s[i] >= y[m - 1])
return -1;
}
vector<tuple<int, int, int>> a, b;
for (int i = 0;i < t;i++) {
a.push_back({w[i], s[i], i});
b.push_back({s[i], w[i], i});
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int l = 1, r = t, ans = t;
auto check = [&](int mid) {
vector<int> vis(t);
int ptr = 0;
set<pair<int, int>> st;
for (int i = 0;i < n;i++) {
while (ptr < t && get<0>(a[ptr]) < x[i]) {
if (!vis[get<2>(a[ptr])])
st.insert({get<1>(a[ptr]), get<2>(a[ptr])});
ptr++;
}
for (int j = 0;j < mid;j++) {
if (st.empty())
break;
auto u = *--st.end();
vis[u.s] = 1;
st.erase(u);
}
}
st.clear();
ptr = 0;
for (int i = 0;i < m;i++) {
while (ptr < t && get<0>(b[ptr]) < y[i]) {
if (!vis[get<2>(b[ptr])])
st.insert({get<1>(b[ptr]), get<2>(b[ptr])});
ptr++;
}
for (int j = 0;j < mid;j++) {
if (st.empty())
break;
auto u = *--st.end();
vis[u.s] = 1;
st.erase(u);
}
}
int g = 1;
for (int i = 0;i < t;i++)
g &= vis[i];
return g;
};
while (l <= r) {
int mid = (l + r) / 2;
if (check(mid)) {
ans = mid;
r = mid - 1;
}
else
l = mid + 1;
}
return ans;
}
