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

题目传送门

解题思路:

懒得写,看大佬的题解,题解传送门

AC代码:

#include<cstdio>
#include<iostream>
#include<queue>

using namespace std;

int m,n,a[200001],b,tot = 1,j;
priority_queue<int> big;
priority_queue<int,vector<int>,greater<int> > small;

int main()
{
    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);
        for(j = tot;j <= b; j++){
            big.push(a[j]);
            if(big.size() == i) {
                small.push(big.top());
                big.pop();
            }
        }
        tot = b + 1;
        printf("%d
",small.top());
        big.push(small.top());
        small.pop();    
    }
    return 0;
}