#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define N 131075
int n;
int r[N];
int lef[N][20];
int logg[N];
void fillsparse(){
for(int i = 1; i <= n; i++){
lef[i][0] = r[i];
for(int j = 1; j < 20; j++){
if(i < (1 << j))
break;
lef[i][j] = max(lef[i][j - 1], lef[i - (1 << (j - 1))][j - 1]);
}
}
logg[1] = 0;
for(int i = 2; i <= 131072; i++)
logg[i] = logg[i / 2] + 1;
}
int getmin(int l, int r){
int sz = logg[r - l + 1];
return max(lef[r][sz], lef[l + (1 << sz) - 1][sz]);
}
int segTree[2 * N];
#define MX 131072
void update(int id, int l, int r, int L, int R){
if(l == L && r == R){
segTree[id]++;
return;
}
int m = (l + r) >> 1;
if(m < L) update(id << 1 | 1, m + 1, r, L, R);
else if(m >= R) update(id << 1, l, m, L, R);
else {
update(id << 1, l, m, L, m);
update(id << 1 | 1, m + 1, r, m + 1, R);
}
}
typedef tree<pair<int, int>, null_type, less_equal<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ordered_set pos;
int GetBestPosition(int NN, int C, int R, int *K, int *S, int *E) {
n = NN;
pos.insert({0, 0});
for(int i = 1; i < n; i++){
r[i] = S[i - 1];
pos.insert({i, i});
}
pos.insert({n, n});
r[n] = -1;
fillsparse();
for(int i = 0; i < C; i++){
S[i]++;
E[i]++;
int lst = (*pos.find_by_order(E[i])).second;
int beg = (*pos.find_by_order(S[i])).first;
for(; E[i] >= S[i]; E[i]--){
pos.erase(pos.find_by_order(E[i]));
}
E[i] = lst;
S[i] = beg;
pos.insert({beg, lst});
if(getmin(S[i], E[i] - 1) < R){
update(1, 1, MX, S[i], E[i]);
}
}
for(int i = 1; i < MX; i++){
segTree[i << 1] += segTree[i];
segTree[i << 1 | 1] += segTree[i];
}
int best = 0;
for(int i = 1; i < n; i++){
if(segTree[MX + i] > segTree[MX + best]){
best = i;
}
}
return best;
}
