树状数组套权值线段树（区间小于w的数权值之和）

#include<bits/stdc++.h>
#define lowbit(x) ((x)&-(x))
#define lc(x) tr[x].l
#define rc(x) tr[x].r
using namespace std;
const int N = 50005;
const int MV = 1e12;
int n,a[N],tot = 0;
struct Node {
	int l, r, v;
}tr[N*16*16*2];
class sgt {
public:
	int root = 0;
	void insert(int &x, int l, int r, int val) {
		if (x == 0)x = ++tot;
		tr[x].v+=val;//把值放到对于区间块内
		if (l == r) return;
		int m = l + r >> 1;
		if (val <= m) insert(lc(x), l, m, val);
		else insert(rc(x), m + 1, r, val);
	}
	int query(int& x, int l, int r, int val) {
		if (r <= val)return tr[x].v;//所在块为val子块直接返回
		int m = l + r >> 1;
		if (val <= m) return query(lc(x), l, m, val);//值在左块内
		else return query(rc(x), m + 1, r, val) + tr[lc(x)].v;//左块加右块
	}
}tree[N];
void add(int x, int d) {
	for (x; x <= n; x += lowbit(x))tree[x].insert(tree[x].root, 1, MV, d);//区间插入x到n
}
int query(int L,int R,int val) {
	int res = 0;
	for (int x = R; x >=1; x -= lowbit(x))res += tree[x].query(tree[x].root,1,MV,val);//区间前缀和
	for (int x = L-1; x >= 1; x -= lowbit(x))res -= tree[x].query(tree[x].root, 1, MV, val);
	return res;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i];
	for (int i = 1; i <= n; i++)add(i, a[i]);
	int m;
	cin >> m;
	while (m--) {
		int l, r;
		cin >> l >> r;
		int ans = 1;
		while (1) {
			int k=query(l, r, ans);
			if (k >= ans)ans = k+1;
			else break;
		}
		cout << ans << '\n';
	}
	return 0;
}