整体二分（模板一）静态区间第K大

 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
 #include <cstdio>//sprintf islower isupper
 #include <cstdlib>//malloc  exit strcat itoa system("cls")
 #include <iostream>//pair
 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\Input.txt","r",stdin);
 #include <bitset>
 //#include <map>
 //#include<unordered_map>
 #include <vector>
 #include <stack>
 #include <set>
 #include <string.h>//strstr substr strcat
 #include <string>
 #include <time.h>// srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 #include <cmath>
 #include <deque>
 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 #include <vector>//emplace_back
 //#include <math.h>
 #include <cassert>
 #include <iomanip>
 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 //******************
 clock_t __START,__END;
 double __TOTALTIME;
 void _MS(){__START=clock();}
 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__START)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 //***********************
 #define rint register int
 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define pr printf
 #define sc scanf
 #define ls rt<<1
 #define rs rt<<1|1
 typedef pair<int,int> PII;
 typedef vector<int> VI;
 typedef long long ll;
 const double E=2.718281828;
 const double PI=acos(-1.0);//
 const ll INF=(1LL<<);
 const int inf=(<<);
 const double ESP=1e-;
 const int mod=(int)1e9+;
 const int N=(int)1e6+;

 PII a[N];
 int ans[N];
 int c[N],maxn,now;
 int lowbit(int n){return n&(-n);}
 void add(int i,int t)
 {
     while(i<=maxn)
     {
         c[i]+=t;
         i+=lowbit(i);
     }
 }
 int Sum(int i)
 {
     int sum=;
     while(i)
     {
         sum+=c[i];
         i-=lowbit(i);
     }
     return sum;
 }
 struct node
 {
     int l,r,k,id;
 }q[N],temp[N];

 void solve(int l,int r,int ql,int qr,int n)
 {
     int L=ql,R=qr,mid=l+r>>;

     if(l==r)
     {
         //    pr("1\n");
         for(int i=ql;i<=qr;++i)ans[q[i].id]=l;
         return;
     }

     while(a[now+].first<=mid&&now+<=n)++now,add(a[now].second,);//这边保证了一个位置最大经过3次;
     while(now&&a[now].first>mid)add(a[now].second,-),--now;//        全清空会TLE;

     for(int i=ql;i<=qr;++i)
     {
         int res=Sum(q[i].r)-Sum(q[i].l-);
         if(res>=q[i].k)temp[L++]=q[i];
         else temp[R--]=q[i];
     }
     for(int i=ql;i<=qr;++i)
         q[i]=temp[i];
     if(L>ql)solve(l,mid,ql,L-,n);
     if(R<qr)solve(mid+,r,R+,qr,n);
 }

 int main()
 {
     int T;
     sc("%d",&T);
     while(T--)
     {
         int n,m;
         sc("%d%d",&n,&m);
         for(int i=;i<=n;++i)sc("%d",&a[i].first),a[i].second=i,c[i]=;
         maxn=n;
         now=;
         for(int i=;i<=m;++i)
             sc("%d%d%d",&q[i].l,&q[i].r,&q[i].k),q[i].id=i;
         sort(a+,a++n);
         solve(-inf,inf,,m,n);
         for(int i=;i<=m;++i)
             pr("%d\n",ans[i]);
     }
     return ;
 }

 /**************************************************************************************/