#include<robots.h>
#include<queue>
#include<algorithm>
using namespace std;
pair<int,int> RW[1000005];
pair<int,int> RS[1000005];
bool Rem[1000005];
bool possible(int sec, int A, int B, int T, int X[], int Y[], int W[], int S[])
{
for(int i=1; i<=T; i++)
Rem[i]=0;
//robotii weak
priority_queue<pair<int,int> > Q;
int ind=1;
for(int i=1; i<=A; i++)
{
while(ind<=T && X[i]>RW[ind].first)
{
Q.push({S[RW[ind].second],RW[ind].second});
ind++;
}
for(int j=1; j<=sec; j++)
{
if(Q.empty())
break;
Rem[Q.top().second]=1;
Q.pop();
}
}
//robotii small
deque<int> Q2;
ind=1;
for(int i=1; i<=B; i++)
{
while(ind<=T && Y[i]>RS[ind].first)
{
if(!Rem[RS[ind].second])
Q2.push_back(RS[ind].second);
ind++;
}
for(int j=1; j<=sec; j++)
{
if(Q2.empty())
break;
Rem[Q2.front()]=1;
Q2.pop_front();
}
}
for(int i=1; i<=T; i++)
if(!Rem[i])
return 0;
return 1;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
for(int i=1; i<=T; i++)
{
RW[i]={W[i],i};
RS[i]={S[i],i};
}
sort(RW+1,RW+T+1);
sort(RS+1,RS+T+1);
sort(X+1,X+A+1);
sort(Y+1,Y+B+1);
int rez=0;
for(int i=19; i>=0; i--)
if(!possible(rez+(1<<i),A,B,T,X,Y,W,S))
rez+=(1<<i);
rez++;
if(rez>T)
rez=-1;
return rez;
}
