#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
void main()
{
int ia[9]={0,8,2,6,7,5,3,4,1};
vector<int> ivec(ia,ia+9);
make_heap(ivec.begin(),ivec.end());//建立堆
for(int i=0;i<ivec.size();++i)
cout<<ivec[i]<<' ';//8 7 5 6 0 2 3 4 1
cout<<endl;
ivec.push_back(9);
push_heap(ivec.begin(),ivec.end());//添加元素重建堆
for(i=0;i<ivec.size();++i)
cout<<ivec[i]<<' ';//9 8 5 6 7 2 3 4 1 0
cout<<endl;
pop_heap(ivec.begin(),ivec.end());//输出堆顶
cout<<ivec.back()<<endl;//9 return but no remove
ivec.pop_back();//remove last elem and no return 清除栈顶
for(i=0;i<ivec.size();++i)
cout<<ivec[i]<<' ';//8 7 5 6 0 2 3 4 1
cout<<endl;
sort_heap(ivec.begin(),ivec.end());//堆排序
for(i=0;i<ivec.size();++i)
cout<<ivec[i]<<' ';//0 1 2 3 4 5 6 7 8
cout<<endl;
}