二叉堆排序

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <queue>
#define MAXN 100010
#define inf 0x3f3f3f3f

using namespace std;

int a[MAXN];
//大顶锥
void HeapAdjust(int index,int n){
    int l = index<<1;
    int r = l+1;
    int temp = index;
    if(index <= n/2){
        if(l <= n && a[l] > a[temp]){
            temp = l;
        }
        if(r <= n && a[r] > a[temp]){
            temp = r;
        }
        if(temp != index){
            swap(a[temp],a[index]);
            HeapAdjust(temp,n);
        }
    }
}
//添加到最后一个位置
//因为原来已经建立成大顶堆了 所以只需向上更新就OK了
void Insert(int index){
    int pre = index>>1;
    while(pre >= 1){
        if(a[index] > a[pre]){
            swap(a[index],a[pre]);
            index = pre;
            pre = index/2;
        }
        else{
            return ;
        }
    }
}
//删除第一个数据
void Del(int n){
    swap(a[1],a[n]);
    int index = 1;
    while(index <= (n-1)/2){
        int l = index<<1;
        int r = l+1;
        int t = index;
        if(l <= (n-1) && a[l] > a[t]){
            t = l;
        }
        if(r <= (n-1) && a[r] > a[t]){
            t = r;
        }
        if(t != index){
            swap(a[t],a[index]);
            index = t;
        }
        else{
            return ;
        }
    }
}
void HeapSort(int n){
    for(int i = n/2; i >= 1; --i){
        HeapAdjust(i,n);
    }
}
void Show(int n){
    for(int i = 1; i <= n; ++i){
        cout<<"a["<<i<<"]"<<" = "<<a[i]<<endl;
    }
}
void Solve(int n){
    for(int i = n; i >= 1; --i){
        swap(a[1],a[i]);
        HeapAdjust(1,i-1);
    }
}
int main()
{
    int n,m,q;
    while(~scanf("%d%d",&n,&m)){
        for(int i = 1; i <= n; ++i){
            scanf("%d",&a[i]);
        }
        HeapSort(n);
        Show(n);
        while(m--){
            scanf("%d",&q);
            if(q == 1){
                cout<<"添加"<<endl;
                cin>>a[++n];
                Insert(n);
                Show(n);
            }
            else{
                cout<<"删除"<<endl;
                Del(n--);
                Show(n);
            }
        }
        cout<<"------"<<endl;
        Solve(n);
        Show(n);
    }
    return 0;
}