get and remove the element with highest priority

this is the element with either minimum or maximum value
depending on the chosen queue/comparator

Time complexity: amortized O(log n) or O(log n) when staying within min_size

post then debug 5 : check_heap_property