P1801 黑匣子_NOI导刊2010提高（06）

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;

priority_queue<int>heapb;
priority_queue<int, vector<int>, greater<int>>heaps;

int m, n;
int cnt = 1;
int a[200010];

int main()
{
    cin >> m >> n;
    for (int i = 1; i <= m; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        int t;
        cin >> t;
        for (; cnt <= t; cnt++)
        {
            heaps.push(a[cnt]);
            int t1, t2;
            if (!heapb.empty() && (t1 = heapb.top()) > (t2 = heaps.top()))
            {
                heapb.pop();
                heaps.pop();
                heapb.push(t2);
                heaps.push(t1);
            }
        }
        heapb.push(heaps.top());
        heaps.pop();
        cout << heapb.top() << endl;
    }
    return 0;
}