| cppreference.com -> C++ Priority Queues |
C++ Priority Queues are like queues, but the elements inside the the data structure are ordered by some predicate.
| empty() | true if the priority queue is empty |
| pop() | removes the first element |
| push() | adds an element |
| size() | returns the number of elements in the priority queue |
| top() | returns the value of the element with highest priority |