STL_queue

queue and priority_queue

push/

pop/

top/

emtpy/

size

priority_queue: default to sort the queue as 6.5.4.3, greater stands front

if we wanna ascending order, using__

priority_queue<int, vector<int>, less<int> > pri_que;

#include <iostream>
#include <list>
#include <vector>
#include <queue>
using namespace std;

int main ()
{
    int tmp[] = {1,2,3,4};
    priority_queue<int> q1(tmp,tmp+4);
    priority_queue<int,vector<int>,less<int> > pq; //default to greater
    q1.push(1);
    q1.push(6);
    pq.pop();
    cout<<q1.top()<<endl;

    pq.size();
    pq.empty();
  return 0;
}