利用大根堆和小根堆的性质,进行维护,
大根堆的元素要一直小于GET的次数(也就是i),每一次操作后都要进行大根堆的元素增加
也就是p.push(q.top()), q.pop();这一步操作!!!!!
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int a[N], b[N];
priority_queue<int> p;
priority_queue<int, vector<int>, greater<>> q;
int main(){
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
for(int i = 1; i <= m; i ++) scanf("%d", &b[i]);
int t = 1;
for(int i = 1;i <= m;i ++){
while(t <= b[i]){
p.push(a[t ++]);
if(p.size() == i) q.push(p.top()), p.pop();
}
printf("%d\n", q.top());
p.push(q.top()), q.pop();
}
return 0;
}