黑盒子（对顶堆）

162. 黑盒子 - AcWing题库

先读入add数列，每次增加一个数，再读入get数列然后返回第i小的数，读的值就是对应的时刻操作的，每次操作后i移动

#include <bits/stdc++.h>
#include <iostream>
#include<unordered_map>
#include<unordered_set>
#define x first
#define y second
#define  ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

using namespace std;

typedef  long  long LL ;
typedef  unsigned long  long ULL ;
typedef pair<int,int> PII ;
typedef pair<LL,int> PLI ;
const int N = 3e4 + 10;


int n,m,a[N],b[N];

inline void solve()
{
    cin >> n >> m;
    for(int i=1;i<=n;i ++ ) cin >> a[i];
    for(int i=1;i<=m;i ++ ) cin >> b[i];

    priority_queue<int> down;//1~i-1
    priority_queue<int,vector<int>,greater<int>> up;
    //i ~ n
    int k=0;
    //i->b, j->时刻;
    for(int i=1,j=1;i<=m; i++ )
    {
        while(j <= b[i])
        {
            if(down.empty() || a[j] >= down.top() ) up.push(a[j]);
            else{
                up.push(down.top());
                down.pop();
                down.push(a[j]);
            }
            j ++;

        }
        down.push(up.top());
        up.pop();
        cout << down.top() << endl;


    }


}
signed main()
{
    ios

    int T=1;
    // cin>>T;
    while(T -- )
    {
        solve();

    }


    return 0;
}