#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
void main()
{
int ia[9]={0,8,2,6,7,5,3,4,1};
priority_queue<int> ipq(ia,ia+9);
cout<<"size="<<ipq.size()<<endl;
for(int i=0;i<ipq.size();++i)
cout<<ipq.top()<<' ';
cout<<endl;
while(!ipq.empty())
{
cout<<ipq.top()<<' ';
ipq.pop();
}
cout<<endl;
}