#include "robots.h"
#include <bits/stdc++.h>
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define ff first
#define ss second
#define LINE "--------------------\n"
using namespace std;
using PII = pair <int, int>;
int n, m, k, a, b;
const int N = 5e4+5;
const int M = 1e6+5;
int wLimit[N], szLimit[N];
int w[M], sz[M];
bool removed[N];
bool solve(int lim) {
priority_queue <PII> vals, vals1;
for (int i = 0; i < n; i++) vals.push({w[i], sz[i]});
for (int i = a-1; i >= 0; i--) {
for (int j = 0; j < lim && !vals.empty(); j++) {
while(!vals.empty()) {
PII tmp = vals.top();
if (wLimit[i] <= tmp.ff) {
vals.pop();
vals1.push({tmp.ss, tmp.ff});
continue;
}
break;
}
if (!vals.empty()) vals.pop();
}
}
while(!vals.empty()) {
PII tmp = vals.top(); vals.pop();
vals1.push({tmp.ss, tmp.ff});
}
for (int i = b-1; i >= 0; i--) {
for (int j = 0; j < lim && !vals1.empty(); j++) {
while(!vals1.empty()) {
PII tmp = vals1.top();
if (szLimit[i] <= tmp.ff) return 0;
break;
}
if (!vals1.empty()) vals1.pop();
}
}
return vals1.size() == 0;
}
int putaway(int weak, int small, int _n, int _wLimit[], int _szLimit[], int _w[], int _sz[]) {
n = _n;
if (weak > 0) sort(_wLimit, _wLimit+weak);
if (small > 0) sort(_szLimit, _szLimit+small);
a = weak;
b = small;
for (int i = 0; i < weak; i++) wLimit[i] = _wLimit[i];
for (int i = 0; i < small; i++) szLimit[i] = _szLimit[i];
for (int i = 0; i < n; i++) w[i] = _w[i], sz[i] = _sz[i];
if (n == 0) return 0;
int l = 1, r = n, ans = 1e9;
while (l <= r) {
int mid = (l+r)>>1;
if (solve(mid)) {
r = mid-1;
ans = mid;
} else {
l = mid+1;
}
}
return ans == 1e9 ? -1 : ans;
}
