# 优先队列priority_queue用法详解

1. 标准库默认使用元素类型的<操作符来确定它们之间的优先级关系。

priority_queue<int> pq;

2. 数据越小，优先级越高

priority_queue<int, vector<int>, greater<int> >pq;

3. 自定义优先级，重载比较符号

struct node
{
friend bool operator< (node n1, node n2)
{
return n1.priority < n2.priority;
}
int priority;
int value;
}; 

 1 #include<iostream>
2 #include<functional>
3 #include<queue>
4 using Namespace stdnamespace std;
5 struct node
6 {
7     friend bool operator< (node n1, node n2)
8     {
9         return n1.priority < n2.priority;
10     }
11     int priority;
12     int value;
13 };
14 int main()
15 {
16     const int len = 5;
17     int i;
18     int a[len] = {3,5,9,6,2};
19     //示例1
20     priority_queue<int> qi;
21     for(i = 0; i < len; i++)
22         qi.push(a[i]);
23     for(i = 0; i < len; i++)
24     {
25         cout<<qi.top()<<" ";
26         qi.pop();
27     }
28     cout<<endl;
29     //示例2
30     priority_queue<int, vector<int>, greater<int> >qi2;
31     for(i = 0; i < len; i++)
32         qi2.push(a[i]);
33     for(i = 0; i < len; i++)
34     {
35         cout<<qi2.top()<<" ";
36         qi2.pop();
37     }
38     cout<<endl;
39     //示例3
40     priority_queue<node> qn;
41     node b[len];
42     b[0].priority = 6; b[0].value = 1;
43     b[1].priority = 9; b[1].value = 5;
44     b[2].priority = 2; b[2].value = 3;
45     b[3].priority = 8; b[3].value = 2;
46     b[4].priority = 1; b[4].value = 4;
47
48     for(i = 0; i < len; i++)
49         qn.push(b[i]);
50     cout<<"优先级"<<'\t'<<"值"<<endl;
51     for(i = 0; i < len; i++)
52     {
53         cout<<qn.top().priority<<'\t'<<qn.top().value<<endl;
54         qn.pop();
55     }
56     return 0;
57 }
• 本文已收录于以下专栏：

举报原因： 您举报文章：优先队列priority_queue用法详解 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)