优先队列

#include<cstdio>

#include<vector>

#include<queue>

using namespace::std;

struct cmp

{

bool operator ()(int &x,int &y)

{

return  x<y;

}

};

priority_queue<int,vector<int>,cmp >Q;//这里是有一个空格的 

int main()

{

int n,temp;

scanf("%d",&n);

for(int i=1;i<=n;i++)

{

scanf("%d",&temp);

Q.push(temp);

}

while(!Q.empty())

{

printf("%d ",Q.top());

Q.pop();

}

}