priority_queue

#include
#include
#include
using namespace std;
int main()
{
priority_queue<pair<int,int> >a;
pair<int,int> b(1,2);
pair<int,int> c(1,3);
pair<int,int> d(2,5);

a.push(d);
a.push(c);
a.push(b);

while(!a.empty())
{
    cout<<a.top().first<<' '<<a.top().second<<endl;
    a.pop();
}

}

#include
#include
using namespace std;
int main()
{
//对于基础类型默认是大堆顶
priority_queue a;
//等同于 priority_queue<int,vector,less >a;

priority_queue<int,vector<int>,greater<int> >c;//小堆顶
priority_queue<string> b;

for(int i=0;i<5;i++)
{
    a.push(i);
    c.push(i);
}
while(!a.empty())
{
    cout<<a.top()<<' ';
    a.pop();
}
while(!c.empty())
{
    cout<<c.top()<<' ';
    cout<<c.pop();
}
cout<<endl;

b.push("abc");
b.push("abcd");
b.push("cbd");
while(!b.empty())
{
    cout<<b.top();
    b.pop();
}
cout<<endl;
return 0;

}