Challenge: Lazy Heap Deletion

Start with the idea

Solve the exact task, not just the visible example: Apply the push/delete operations, then return the valid minimum requested by min. On input push4 push7 push2 delete2 min, predict the output before opening the answer reveal. The revealed output is a test oracle for this case, while private checks exercise other legal cases. Start by stating the input grammar and output format in your own words. Parse the complete input, including surrounding whitespace, before relying on any convenient positions in the example.

Build the solution around one maintained claim: Record invalidated values separately and discard stale roots only when they surface. Decide what state represents that claim, how it is initialized, what a single update does, and when the algorithm stops. A heap keeps the current extremum accessible while new items arrive. Explain what belongs in the heap and what may be discarded. Trace the visible input by hand and record at least two intermediate states, not only the final answer. If the trace cannot justify your predicted output, there is a gap between the idea and the implementation.

Use the Rust sketch as a guide, not a substitute for a complete solve function. The supplied Rust sketch is a starting point. Identify what it stores, how one iteration changes it, and whether it already solves the exact task or only demonstrates a related operation. Rust BinaryHeap is a max-heap; Reverse can express a min-heap.