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 << "less<int>" << endl;
	while (!q.empty()) {
		cout << q.top() << " ";
		q.pop();
	}
	cout << endl;
	cout << "greater<int>" << endl;
	while (!p.empty()) {
		cout << p.top() << " ";
		p.pop();
	}
	return 0;
}