Kqueryo doubt code

#1

giving wrong for one test case

#2

@rohit_1906
Your logic is correct but there are few mistake in your code. I am pointing them

  1. your are filling array from 0 to (n-1) but building your tree from 1 to n. Change condition in line 32 to for(ll i=1;i<=n;i++)
  2. After print m, make ans=m for next iteration
  3. You have to find elements greater than k, not greater than equals to k. In line 22 you are finding lower_bound of k, which includes elements eqaul to k in final ans. So change lower_bound() in line 22 to (lower_bound(tree[node].begin(),tree[node].end(),k+1)
#3

@rohit_1906
Here is the updated code, Working for all cases