【堆】poj 1441

#include <vector>#include <list>#include <map>#include <set>#include <queue>#include <string.h>#include <deque>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <limits.h>using namespace std;int lowbit(int t){return t&(-t);}int countbit(int t){return (t==0)?0:(1+countbit(t&(t-1)));}int gcd(int a,int b){return (b==0)?a:gcd(b,a%b);}#define LL long long#define PI acos(-1.0)#define N  100010#define MAX INT_MAX#define MIN INT_MIN#define eps 1e-8#define FRE freopen("a.txt","r",stdin)//POJ 1441 Heap//Author:leolin//2011 8 13//感覺堆Heap這個東西很神奇。//開兩個堆，一個大根堆，一個小根堆，大根堆存放比i小的數，//小根堆存放比i大的數，每次詢問從小根堆裡去最小的int a[N],u[N];priority_queue<int> px;priority_queue<int,vector<int>,greater<int> > pn;int main(){    int n,m;    int t;    scanf("%d",&t);        while(t--)        {        scanf("%d%d",&n,&m);        int i,j,k;        while(!pn.empty())pn.pop();        while(!px.empty())px.pop();        memset(a,0,sizeof(a));        memset(u,0,sizeof(u));        for(i=1;i<=n;i++)scanf("%d",&a[i]);        for(i=1;i<=m;i++)scanf("%d",&u[i]);        for(i=1,j=1;i<=n;i++)        {            px.push(a[i]);            pn.push(px.top());            px.pop();            while(u[j]==i)            {                int tmp=pn.top();                px.push(tmp);                pn.pop();                printf("%d\n",tmp);                j++;            }        }        if(t)printf("\n");    }    return 0;}