【STL】heap堆算法

关于堆的实现原理，见【优先队列(堆)】二叉堆类模板的实现

#include<vector>
#include<iostream>
#include<algorithm> //heap algorithm
using namespace std;

int main()
{
    { //test heap 底层以vector完成
        int ia[9]{0,1,2,3,4,7,5,6,8};
        vector<int> ivec(ia,ia+9);

        make_heap(ivec.begin(),ivec.end());//建堆
        for(int i=0;i<ivec.size();++i)cout<<ivec[i]<<' '; 
        //8 6 7 3 4 2 5 1 0
        cout<<endl;

        ivec.push_back(9);
        push_heap(ivec.begin(),ivec.end());//插入一个元素
        for(int i=0;i<ivec.size();++i)cout<<ivec[i]<<' '; 
        //9 8 7 3 6 2 5 1 0 4
        cout<<endl;

        pop_heap(ivec.begin(),ivec.end());
        for(int i=0;i<ivec.size();++i)cout<<ivec[i]<<' '; 
        //8 6 7 3 4 2 5 1 0 9
        cout<<endl;
        ivec.pop_back();
        cout<<ivec.back()<<endl; // 0

        sort_heap(ivec.begin(),ivec.end()); //堆排序
        for(int i=0;i<ivec.size();++i)cout<<ivec[i]<<' '; 
        //0 1 2 3 4 5 6 7 8
        cout<<endl;
    }
}