优先队列那些事儿

13
/  \
21   16
/  \  / \
24  31 19 68
/  \ /
65 26 32

void Insert(int x,priority_queue q){
for(i=q.size()+1;x<q.elements[i/2];i/=2){
q.eletments[i]=q.eletemnet[i/2];
}
q.elements[i]=x;
}

int DeleteMin(priority_queue q){
if(isEmpty()) error();
int min=q.elements[1];//得到了最小值
int lastone=q.elements[q.size()--];
int child;//接下来一个要被上率的位置
for(int i=1;i*2<=q.size();i=child){
child=i*2;
if(child!=q.size()&&q.elements[child+1]>q.elements[i])
child++;
if(lastone>q.elements[child])
q.elements[i]=q.elements[child];
else
break;
}
q.elements[i]=lastone;
return min;
}