二叉堆/C

//Buffalo_NGJ
struct heap{
     int a[32768],n;
     int pre(int p){return p-1>>1;};
     int left(int p){return (p<<1)+1;};
     int right(int p){return (p<<1)+2;};
     void ins(int x){
          int p;n++;
          for(p=n-1;p>0;){
              if(x<a[pre(p)])
                  a[p]=a[pre(p)],p=pre(p);
              else break;
              }
          a[p]=x;
          }
     int pop(){
         int p,x=a[0],tmp;
         for(p=0,n--;left(p)<n;){
             tmp=(right(p)<n&&a[right(p)]<a[left(p)])?right(p):left(p);
             if(a[tmp]<a[n])a[p]=a[tmp],p=tmp;
             else break;
             }
         a[p]=a[n];
         return x;
         }
     };