#include <iostream>
#include <queue>
#include <initializer_list>

using namespace std;
int main(){
	//建堆
	priority_queue<int, vector<int>, greater<int> > minheap;
	
	priority_queue<int, vector<int>, less<int> > maxheap;


	//插入
    for(int n : {1,8,5,6,3,4,0,9,7,2}){
		minheap.push(n);
		maxheap.push(n);
	}


	//输出堆(取出堆顶元素，删除对应元素)
	cout<<"*********最小堆*********"<<endl;
	while(!minheap.empty()){
		cout<<minheap.top()<<" ";
		minheap.pop();
	}

	cout<<"\n\n\n\n*********最大堆*********"<<endl;
	while(!maxheap.empty()){
		cout<<maxheap.top()<<" ";
		maxheap.pop();
	}
}