记住优先队列都是反着来的
-
priority_queue q;
默认为由大到小 (与sort默认由小到大相反) -
priority_queue<int, std::vector, std::greater > q;
由小到大排序
/*
*
将 1-9 压入队列中
1. std::priority_queue<int> q; -> 从大到小排列
2. std::priority_queue<int, std::vector<int>, std::greater<int> > q2; ->从小到大
3.用 lambda 比较元素。//没理解
*/
#include <functional>
#include <queue>
#include <vector>
#include <iostream>
//using namespace std;
template<typename T> void print_queue(T& q) {
while(!q.empty()) {
std::cout << q.top() << " ";
q.pop();
}
std::cout << '\n';
}
int main() {
std::priority_queue<int> q;
for(int n : {
1,8,5,6,3,4,0,9,7,2})
q.push(n)