#include<iostream>
#include<cstdlib>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
int s;
friend bool operator<(node a,node b)
{
return a.s<b.s;//小于,最大值优先
//return a.s>b.s;//大于,最小值优先
}
}a[1024];
int main()
{
//a[4]={3, 2 ,4, 6};
priority_queue<node> q;
for(int i=0;i<4;i++)
{
cin>>a[i].s;
q.push(a[i]);
}
while(!q.empty())
{
cout<<q.top().s<<" ";
q.pop();
}
return 0;
}
//输入:3 2 4 6
//输出:6 4 3 2
//q.pop();对头出来
//q.push();压进去
//q.empty();队列为空,为1
基本跟队列差不多吧
以后想到再补充吧