我试了啊啊啊

常规
1 
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    priority_queue<int >pq;
    int height;
    for(int i=0;i<n;i++) {
        cin>>height;
        pq.push(height);
        if(i>=m-1){
            cout<<pq.top()<<" ";
            pq.pop();
            if(i>=n-m+1){
            	break;	
			}
        }
    }
    return 0;
}
2

xsmjl

3 
分成 1-m和m+1-n
for(int i=m+1;i<=n;i++)
    {
    	pq.push(a[i]);
    	cout<<q.top()<<endl;
		q.pop();
	}