A priority queue supports Push and Pop, where Pop returns the most urgent item (smallest or largest key). It is an interface, not a layout; the usual implementation is a binary heap. Equal priorities have no defined order unless you add a tie-break such as a sequence number.
Priority queue
An abstract container where you always remove the item with the highest priority first, not the oldest.