#include <bits/stdc++.h>
#include "robots.h"
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 1e6 + 10;
vector<pii> all;
int chk[N];
int putaway( int a, int b, int t, int x[], int y[], int w[], int s[] ) {
for( int i = 0 ; i < t ; i++ ) all.emplace_back( pii( w[i], s[i] ) );
sort( all.begin(), all.end() ), sort( x, x + a ), sort( y, y + b );
int l = 0, r = t;
while( l < r ) {
priority_queue<pii> q;
memset( chk, 0, sizeof chk );
int mid = ( l + r + 1 ) >> 1;
int j = 0, cc = 0;
for( int i = 0 ; i < a ; i++ ) {
int now = 0;
while( j < t && all[j].x < x[i] ) q.emplace( pii( all[j].y, j ) ), j++;
while( !q.empty() && now < mid ) chk[q.top().y] = 1, q.pop(), now++;
}
for( ; j < t ; j++ ) q.emplace( pii( all[j].y, j ) );
for( int i = b - 1 ; i >= 0 ; i-- ) {
int now = 0;
while( now < mid && !q.empty() ) {
pii temp = q.top(); q.pop();
if( temp.x < y[i] ) now++, chk[temp.y] = 1;
}
}
for( int i = 0 ; i < t ; i++ ) if( !chk[i] ) cc = 1;
if( cc ) l = mid + 1;
else r = mid;
}
return l;
}
