#include "king.h"
using namespace std;
long long SendInfo(std::vector<int> W, std::vector<int> C) {
return 0LL;
}
#include "vassal.h"
#include <vector>
#include <algorithm>
#define pii pair<int,int>
using namespace std;
vector<pii> vec;
int n;
int p[100001];
int find(int a) {
if (p[a] == a) return a;
return p[a] = find(p[a]);
}
void merge(int a, int b) {
a = find(a);
b = find(b);
if (a == b) return;
p[b] = a;
}
void Init(long long B, std::vector<int> C){
int N = C.size();
for (int i = 0; i < N; i++) {
p[i] = i;
vec.push_back({ C[i],i });
}
p[N] = N;
n = N;
sort(vec.begin(), vec.end());
}
int Maid(int W){
int idx = upper_bound(vec.begin(), vec.end(), pii(W, -1)) - vec.begin();
if (idx == 0) return -1;
idx = find(idx);
if (idx > 0) {
merge(idx - 1, idx);
return vec[idx - 1].second;
}
return -1;
}
