//优先队列主要2个函数 push(),top(),
//建立队列时,需要priority_queue<>;
#include<stdio.h>
#include<queue>
using namespace std;
struct Node
{
int priority;
int value;//自己可以定义大的在下,小的在上
friend bool operator <(Node n1,Node n2)
{
return n2.priority<n1.priority;
}
};
int main()
{
int i;
priority_queue<int>Q1;
for(i=1;i<=4;i++)
Q1.push(9-i);
for(i=1;i<=4;i++)
{
printf("%d\n",Q1.top());
Q1.pop();
}//优先级别最先默认小的在下 大的在上
priority_queue<Node>Q2;
Node a1,a2,a3,a4;
a1.priority=9;
a1.value=9;
a2.priority=8;
a2.value=8;
a3.priority=7;
a3.value=7;
a4.priority=6;
a4.value=6;
Q2.push(a1);
Q2.push(a2);
Q2.push(a3);
Q2.push(a4);
for(i=1;i<=4;i++)
{
printf("%d\n",Q2.top());
Q2.pop();
}
return 0;
}
//建立队列时,需要priority_queue<>;
#include<stdio.h>
#include<queue>
using namespace std;
struct Node
{
int priority;
int value;//自己可以定义大的在下,小的在上
friend bool operator <(Node n1,Node n2)
{
return n2.priority<n1.priority;
}
};
int main()
{
int i;
priority_queue<int>Q1;
for(i=1;i<=4;i++)
Q1.push(9-i);
for(i=1;i<=4;i++)
{
printf("%d\n",Q1.top());
Q1.pop();
}//优先级别最先默认小的在下 大的在上
priority_queue<Node>Q2;
Node a1,a2,a3,a4;
a1.priority=9;
a1.value=9;
a2.priority=8;
a2.value=8;
a3.priority=7;
a3.value=7;
a4.priority=6;
a4.value=6;
Q2.push(a1);
Q2.push(a2);
Q2.push(a3);
Q2.push(a4);
for(i=1;i<=4;i++)
{
printf("%d\n",Q2.top());
Q2.pop();
}
return 0;
}