优先队列priority_queue是一种容器,它可以使得其第一个元素始终是它包含的最大元素,具体实现原理是堆排序。默认是大顶堆
#include<iostream>
#include<vector>
#include<algorithm>
#include <queue>
#include <functional>
using namespace std;
int main(){
//大顶堆
priority_queue<int, vector<int>, less<int>> q;
//小顶堆
priority_queue<int, vector<int>, greater<int>> p;
for (int i = 0; i < 10; i++) {
q.push(i);
p.push(i);
}
cout << "大顶堆 " << endl;
while (!q.empty()) {
cout << q.top() << " ";
q.pop();
}
cout << endl;
cout << "小顶堆 " << endl;
while (!p.empty()) {
cout << p.top() << " ";
p.pop();
}
return 0;
}
输出:
大顶堆
9 8 7 6 5 4 3 2 1 0
小顶堆
0 1 2 3 4 5 6 7 8 9