优先队列测试程序

默认实现的是最大堆，将比较器改成greater可将其变成最小堆。

#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <string>
using namespace std;

template <typename PriorityQueue>
void dumpContents(const string & msg,PriorityQueue & pq)
{
    cout<<msg<<":"<<endl;
    while (!pq.empty())
    {
        cout<<pq.top()<<endl;
        pq.pop();
    }
}

int main(int argc, const char * argv[]) {
    // insert code here...

    priority_queue<int> maxPQ;
    priority_queue<int,vector<int>,greater<int>> minPQ;

    minPQ.push(4);minPQ.push(3);minPQ.push(5);
    maxPQ.push(4);maxPQ.push(3);maxPQ.push(5);

    dumpContents("minPQ", minPQ);
    dumpContents("maxPQ", maxPQ);

    return 0;
}