Sequentially Ordinal Rank Tracker

This is the Sequentially Ordinal Rank Tracker design problem: get() asks for the first, then second, then third best item over time. Maintain two heaps. The selected min-heap holds exactly the items already eligible to be returned, so its root is the lowest-ranked item among that selected prefix. The remaining max-heap holds every other item, with its root being the best item not yet selected. On add, insert into the appropriate heap and move roots until every selected item ranks above every remaining item. On get, move the best item from remaining to selected if needed, then return selected.peek(). Define a stable comparator such as score descending then name ascending. Each insertion or request costs O(log n) time and total space is O(n). State the heap invariant before coding; it prevents off-by-one errors around the first get().