|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25 |
//采用默认优先关系://(priority_queue<int>que;)//Queue 0:// 91 83 72 56 47 36 22 14 10 7 3////采用结构体自定义优先级方式一://(priority_queue<int,vector<int>,cmp>que;)//Queue 1:// 3 7 10 14 22 36 47 56 72 83 91//Queue 2:// 91 83 72 56 47 36 22 14 10 7 3////采用头文件"functional"内定义优先级：//(priority_queue<int, vector<int>,greater<int>/less<int> >que;)//Queue 3:// 3 7 10 14 22 36 47 56 72 83 91//Queue 4 :// 91 83 72 56 47 36 22 14 10 7 3////采用结构体自定义优先级方式二://(priority_queue<number>que)//Queue 5:// 3 7 10 14 22 36 47 56 72 83 91//Queue 6:// 91 83 72 56 47 36 22 14 10 7 3 |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142 |
<br><br>#include <iostream>#include <functional>#include <stdio.h>#include <queue>#include <vector>#include <stdlib.h>using
namespace std;struct
cmp1{ bool
operator () (int
&a, int
&b) { return
a > b ; // 从小到大排序，值 小的 优先级别高 }};struct
cmp2{ bool
operator () (int
&a, int
&b) { return
a < b; // 从大到小 }};struct
number1{ int
x; bool
operator < (const
number1 &a)const { return
x > a.x; // 从小到大 ，x 小的 优先级别高 }};struct
number2{ int
x; bool
operator < (const
number2 &a)const { return
x < a.x; // 从大到小 ，x 大的优先级别高 }};int
a[] = {14,10,56,7,83,22,36,91,3,47,72,0};number1 num1[] = {14,10,56,7,83,22,36,91,3,47,72,0};number2 num2[] = {14,10,56,7,83,22,36,91,3,47,72,0};int
main(){ priority_queue<int>que; // 采用默认优先级构造队列 从大到小。 priority_queue<int, vector<int>, cmp1 >que1; priority_queue<int, vector<int>, cmp2 >que2; priority_queue<int, vector<int>, greater<int> > que3; //functional 头文件自带的 priority_queue<int, vector<int>, less<int> > que4; //functional 头文件自带的 priority_queue<number1> que5; priority_queue<number2> que6; int
i; for(i=0; a[i]; i++) { que.push(a[i]); que1.push(a[i]); que2.push(a[i]); que3.push(a[i]); que4.push(a[i]); } for(i=0; num1[i].x; i++) que5.push(num1[i]); for(i=0; num2[i].x; i++) que6.push(num2[i]); printf("采用默认优先关系:\n(priority_queue<int>que;)\n"); printf("Queue 0:\n"); while(!que.empty()) { printf("%3d",que.top()); que.pop(); } puts(""); puts(""); printf("采用结构体自定义优先级方式一:\n(priority_queue<int,vector<int>,cmp>que;)\n"); printf("Queue 1:\n"); while(!que1.empty()) { printf("%3d",que1.top()); que1.pop(); } puts(""); printf("Queue 2:\n"); while(!que2.empty()) { printf("%3d",que2.top()); que2.pop(); } puts(""); puts(""); printf("采用头文件\"functional\"内定义优先级：\n(priority_queue<int, vector<int>,greater<int>/less<int> >que;)\n"); printf("Queue 3:\n"); while(!que3.empty()) { printf("%3d",que3.top()); que3.pop(); } puts(""); printf("Queue 4 :\n"); while(!que4.empty()) { printf("%3d",que4.top()); que4.pop(); } puts(""); puts(""); printf("采用结构体自定义优先级方式二:\n(priority_queue<number>que)\n"); printf("Queue 5:\n"); while(!que5.empty()) { printf("%3d",que5.top()); que5.pop(); } puts(""); printf("Queue 6:\n"); while(!que6.empty()) { printf("%3d",que6.top()); que6.pop(); } system("pause"); return
0;} |
priority_queue 优先队列用法,布布扣,bubuko.com
原文：http://www.cnblogs.com/aljxy/p/3602153.html