STL——队列

声明
        queue<int> q;
        priority_queue<int> q;                           //大根堆
        priority_queue<int,vector<int>,greater<int>> q;  //小根堆

        priority_queue<node,vector<node>,cmp> q;         //小根堆

        struct cmp
        {
            bool operator()(node x,node y)
            {
                return x.z >y.z;
            }
        };
访问/添加/删除
        q.front()
        q.back()
        q.top()

        q.push()
        q.pop()
函数       
        q.empty()
        q.size()