std::priority_queue::pop

From cppreference.com

void pop();

Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();

Contents

[edit] Parameters

(none)

[edit] Return value

(none)

[edit] Complexity

Logarithmic number of comparisons plus the complexity of Container::pop_back.

[edit] See also

(C++11)
constructs element in-place and sorts the underlying container
(public member function)
inserts element and sorts the underlying container
(public member function)
accesses the top element
(public member function)