std::priority_queue::pop
科技促进发展:优先事项[医]队列::POP
void pop( | | |
---|
从优先级队列中移除top元素。有效呼叫std::pop_heap
(c.begin(), c.end(), comp c.pop_back(
参数
%280%29
返回值
%280%29
复杂性
比较的对数数加上Container::pop_back
...
另见
emplace (C++11) | constructs element in-place and sorts the underlying container (public member function) |
---|---|
push | inserts element and sorts the underlying container (public member function) |
top | accesses the top element (public member function) |
© cppreference.com
在CreativeCommonsAttribution下授权-ShareAlike未移植许可v3.0。