C++ 之 优先队列 priority_queue

priority_queue<int>q1;

int a[5]={3,1,2,4,5};
priority_queue<int>q1;
for(int i = 0 ; i<5;i++)
q1.push(a[i]);
for(int i = 0 ; i < 5;i++)
{
printf("%d ",q1.top());
q1.pop();
}
printf("\n");</span></strong>

priority_queue<int,vector<int>,greater<int> >q2;//*这里的>>一定要分开！

int a[5]={3,1,2,4,5};
priority_queue<int,vector<int>,greater<int> >q2;
for(int i = 0 ; i < 5;i++)
q2.push(a[i]);
for(int i = 0 ; i <5;i++)
{
printf("%d ",q2.top());
q2.pop();
}
printf("\n");

struct node
{
friend bool operator< (node n1, node n2)
{
return n1.p < n2.p;
}
int p;
int val;
}b[5];  //*这里面没有 > 符号， 只支持 <; </span></strong>

priority_queue<node>q3;

#include<iostream>
#include<functional>
#include<queue>
using namespace std;
struct node
{
friend bool operator< (node n1, node n2)
{
return n1.priority < n2.priority;
}
int priority;
int value;
};
int main()
{
const int len = 5;
int i;
int a[len] = {3,5,9,6,2};
//示例3
priority_queue<node> qn;
node b[len];
b[0].priority = 6; b[0].value = 1;
b[1].priority = 9; b[1].value = 5;
b[2].priority = 2; b[2].value = 3;
b[3].priority = 8; b[3].value = 2;
b[4].priority = 1; b[4].value = 4;

for(i = 0; i < len; i++)
qn.push(b[i]);
cout<<"优先级"<<'\t'<<"值"<<endl;
for(i = 0; i < len; i++)
{
cout<<qn.top().priority<<'\t'<<qn.top().value<<endl;
qn.pop();
}
return 0;
}