| 5 | import heapq |
| 6 | |
| 7 | class PriorityQueue: |
| 8 | def __init__(self): |
| 9 | self._queue = [] |
| 10 | self._index = 0 |
| 11 | |
| 12 | def push(self, item, priority): |
| 13 | heapq.heappush(self._queue, (-priority, self._index, item)) |
| 14 | self._index += 1 |
| 15 | |
| 16 | def pop(self): |
| 17 | return heapq.heappop(self._queue)[-1] |
| 18 | |
| 19 | # Example use |
| 20 | class Item: |