#include "robots.h" #include <bits//stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset; #define ll long long #define ld long double #define iloop(m, h) for (ll i = m; i != h; i += (m < h ? 1 : -1)) #define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1)) #define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1)) #define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1)) #define iloop_(m, h, g) for (auto i = m; i < h; i += g) #define jloop_(m, h, g) for (auto j = m; j < h; j += g) #define kloop_(m, h, g) for (auto k = m; k < h; k += g) #define lloop_(m, h, g) for (auto l = m; l < h; l += g) #define getchar_unlocked _getchar_nolock // comment before submission #define pll pair<ll, ll> #define plll pair<ll, pll> #define pllll pair<pll, pll> #define vll vector<ll> #define qll queue<ll> #define dll deque<ll> #define pqll priority_queue<ll> #define gll greater<ll> #define INF 1000000000000000 #define MOD1 1000000007 #define MOD2 998244353 #define MOD3 1000000009 mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) { ll n = T; pll a[n]; iloop(0, n) a[i] = {W[i], S[i]}; sort(a, a+n); sort(X, X+A); sort(Y, Y+B, greater<int>()); ll lb = 1, ub = n+1, mid, cptr; while (lb < ub) { mid = (lb + ub) >> 1; priority_queue<ll> pq; cptr = 0; iloop(0, A) { while (cptr < n && a[cptr].first < X[i]) { pq.push(a[cptr].second); cptr++; } jloop(0, mid) { if (!pq.size()) break; pq.pop(); } } while (cptr < n) { pq.push(a[cptr].second); cptr++; } iloop(0, B) jloop(0, mid) { if (!pq.size() || pq.top() >= Y[i]) break; pq.pop(); } if (pq.size()) lb = mid + 1; else ub = mid; } return (lb == n+1 ? -1 : lb); }