样例未过，20分求调

#include <bits/stdc++.h>
using namespace std;
int m,n,a[200005],b[200005],cnt;
void push_up(int p){
	while (p>1){
		if (a[p/2]<a[p]) break;
		swap(a[p/2],a[p]);
		p/=2;
	}
	return;
}
void push_down(int p){
	cout << a[p] << endl;
	swap(a[cnt],a[1]);
	a[cnt] = 0;
	cnt --;
	int k = 2*p;
	while (k <= cnt){
		if (k+1<=cnt&&a[k+1]<a[k]) k++;
		if(a[k]<a[p]) swap(a[k],a[p]);
		else break; 
		p = k;
		k *= 2;
	}
	return;
}
int main (){
	cin >> m >> n;
	for (int i = 1;i <= m;i ++) {
		cin >> a[++cnt];
		push_up(cnt);
	}
	for (int i = 1;i <= n;i ++){
		cin >> b[i];
		push_down(1);
	} 
	return 0;
}