poj 1442 Black Box

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

struct cmp1
{
     bool operator() ( const int a, const int b )
     { return a > b; }
};

struct cmp2
{
     bool operator()( const int a, const int b )
     { return a < b; }
};

priority_queue<int,vector<int>,cmp1>MaxHeap;
priority_queue<int,vector<int>,cmp2>MinHeap;
int a[30000];

int main()
{
    int m, n, i, K;
    int Count = 0, Tmp;
    
    scanf( "%d%d", &m, &n );
    for ( i = 0; i < m; i++ )
        scanf( "%d", &a[i] );
    
    for( i = 0; i < n; i++ )
    {
        scanf( "%d", &K );
        while ( Count < K )
        {
            MaxHeap.push(a[Count]);
            if( !MinHeap.empty() && MaxHeap.top() < MinHeap.top() )
            {
                Tmp = MaxHeap.top();
                MaxHeap.pop();
                MaxHeap.push( MinHeap.top() );
                MinHeap.pop();
                MinHeap.push(Tmp);
            }
            Count++;
        }
        printf( "%d\n", MaxHeap.top() );
        MinHeap.push( MaxHeap.top() );
        MaxHeap.pop();
    }
}