c++ 优先级队列 priority_queue

#include <iostream>
using namespace std;
#include "queue"
#include <vector>  
#include <functional>  //最小值优先级队列库

void main81()
{
    priority_queue<int> p1;
    priority_queue<int, vector<int>, less<int>> p2;
    priority_queue<int, vector<int>, greater<int>> p3;
    p1.push(33);
    p1.push(22);
    p1.push(55);
    p1.push(11);
    cout << "队列头元素：" << p1.top() << endl;
    cout << "队列的大小：" << p1.size() << endl;
    while (p1.size()>0)
    {
        cout<< p1.top() << " ";
        p1.pop();
    }


    p3.push(33);
    p3.push(22);
    p3.push(55);
    p3.push(11);
    cout << "队列头元素：" << p3.top() << endl;
    cout << "队列的大小：" << p3.size() << endl;
    while (p3.size()>0)
    {
        cout << p3.top() << " ";
        p3.pop();
    }
}

void main()
{
    main81();
    system("pause");
}