Namespaces
Variants

std::priority_queue<T,Container,Compare>:: push

From cppreference.net

C++
Containers library
std::priority_queue
void push ( const value_type & value ) ;
(1)
void push ( value_type && value ) ;
(2) (自 C++11 起)

将给定元素 value 推入优先队列。

1) 等价于： c. push_back ( value ) ; std:: push_heap ( c. begin ( ) , c. end ( ) , comp ) ; 。
2) 等价于： c. push_back ( std :: move ( value ) ) ; std:: push_heap ( c. begin ( ) , c. end ( ) , comp ) ; 。

目录

参数

value - 要压入的元素值

返回值

(无)

复杂度

比较次数的对数加上 Container :: push_back 的复杂度。

示例

运行此代码 
#include <iostream>
#include <queue>
struct Event
{
    int priority{};
    char data{' '};
    friend bool operator<(Event const& lhs, Event const& rhs)
    {
        return lhs.priority < rhs.priority;
    }
    friend std::ostream& operator<<(std::ostream& os, Event const& e)
    {
        return os << '{' << e.priority << ", '" << e.data << "'}";
    }
};
int main()
{
    std::priority_queue<Event> events;
    std::cout << "填充事件队列：\t";
    for (auto const e : {Event{6,'L'}, {8,'I'}, {9,'S'}, {1,'T'}, {5,'E'}, {3,'N'}})
    {
        std::cout << e << ' ';
        events.push(e);
    }
    std::cout << "\n处理事件：\t\t";
    for (; !events.empty(); events.pop())
    {
        Event const& e = events.top();
        std::cout << e << ' ';
    }
    std::cout << '\n';
}

输出： 

Fill the events queue:  {6, 'L'} {8, 'I'} {9, 'S'} {1, 'T'} {5, 'E'} {3, 'N'}
Process events:         {9, 'S'} {8, 'I'} {6, 'L'} {5, 'E'} {3, 'N'} {1, 'T'}

参见

(C++11)
原地构造元素并对底层容器进行排序
(公开成员函数)
移除顶部元素
(公开成员函数)