Defined in header
Priority queue is a container that allows for constant time maximum (or minimum, depending on
Compare) extraction at the expense of logarithmic insertion. Working with a
priority_queue is similar to managing a heap in some random access container, with the benefit of not being able to accidentally invalidate the heap.
| the comparison function object |
(protected member object)