[堆] POJ 3481 Double Queue

就是很基础的两个堆 无聊了打打

据说有人用平衡树？

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<queue>
using namespace std;
typedef pair<int,int> abcd;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

struct Heap1{
  priority_queue<abcd> Q,del;
  void maintain(){ while (!Q.empty() && !del.empty() && Q.top()==del.top()) Q.pop(),del.pop(); }
  abcd top(){ maintain(); return Q.top(); }
  void pop(){ maintain(); Q.pop(); }
  void push(abcd x){ maintain(); Q.push(x); }
  void erase(abcd x){ maintain(); del.push(x); }
  bool empty(){ maintain(); return Q.empty(); }
}Max;

struct Heap2{
  priority_queue<abcd,vector<abcd>,greater<abcd> > Q,del;
  void maintain(){ while (!Q.empty() && !del.empty() && Q.top()==del.top()) Q.pop(),del.pop(); }
  abcd top(){ maintain(); return Q.top(); }
  void pop(){ maintain(); Q.pop(); }
  void push(abcd x){ maintain(); Q.push(x); }
  void erase(abcd x){ maintain(); del.push(x); }
  bool empty(){ maintain(); return Q.empty(); }
}Min;

int main(){
  int order,x,y;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  while (1){
    read(order);
    if (order==0) break;
    if (order==1){
      read(x); read(y);
      Max.push(abcd(y,x));
      Min.push(abcd(y,x));
    }else if (order==2){
      if (Max.empty())
	printf("0\n");
      else{
	abcd t=Max.top(); Max.pop(); Min.erase(t);
	printf("%d\n",t.second);
      }
    }else if (order==3){
      if (Min.empty())
	printf("0\n");
      else{
	abcd t=Min.top(); Min.pop(); Max.erase(t);
	printf("%d\n",t.second);
      }
    }
  }
  return 0;
}