#include <iostream>
#include <queue>
#include <vector>
#include <memory>
#include <functional>
using namespace std;
int main() {
priority_queue<int> q;
q.push(2);
q.push(7);
q.push(4);
q.push(5);
q.push(1);
while (!q.empty()) {
// 输出是 7 5 4 2 1 ,是有顺序的。
cout << q.top() << endl;
q.pop();
}
cout << "有序队列: " << endl;
priority_queue<int, vector<int>, greater<int> > pq;
pq.push(2);
pq.push(7);
pq.push(4);
pq.push(5);
pq.push(1);
while (!pq.empty()) {
cout << pq.top() << endl;
pq.pop();
}
// priority_queue<
// pair<int, int>,
// vector<pair<int, int>>,
// greater<pair<int, int>>>
// q2;
// q2.push({1, 1});
// q2.push({2, 2});
// q2.push({0, 3});
// q2.push({9, 4});
// while (!q2.empty())
// {
// cout << q2.top() << endl;
// q2.pop();
// }
}
10-07
8万+
09-17
450
09-11
275
09-14
209