STL大根堆小根堆

题目

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef pair<int,int>pill;
priority_queue <pill,vector<pill>,less<pill> > Q;
const int N=2e6+10;
int n,k,a[N];
int main()
{
    
    
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
    
    
		cin>>a[i];
		Q.push(mp(a[i],i));
		if(i>=k)
		{
    
    
			while(Q.top().second<=i-k)Q.pop();
			cout<<Q.top().first<<endl;
		}
	}
	return 0;
}