P1801 黑匣子(对顶堆)

P1801 黑匣子https://www.luogu.com.cn/problem/P1801

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int a[MAXN], u[MAXN];
int m, n;
int main() {
	priority_queue<int, vector<int>, greater<int> > q1;
	priority_queue<int, vector<int>, less<int> > q2;
	scanf("%d %d", &m, &n);
	for (int i = 1; i <= m; i++) {
		scanf("%d", a + i);
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", u + i);
	}
	int p = 0;
	for (int i = 1; i <= n; i++) {
		while (p < u[i]) {
			p++;
			q2.push(a[p]);
			q1.push(q2.top());
			q2.pop();
		}
		printf("%d\n", q1.top());
		q2.push(q1.top());
		q1.pop();
	}
	return 0;
}