Priority Task Executor

Priority Queue with Lazy Deletion We model each addTask call as an occurrence, holding the task identifier, the declared priority, the timestamp, and an insertion sequence number. The sequence number ensures a total order even when two occurrences share the same priority and timestamp — the one that arrived earlier (smaller sequence) comes first. The heart of the design is a max‑priority min‑heap (we invert the priority key so Python’s built‑in min‑heap works; in Java we…