Method that returns the maximum element in the queue (heapq)?

Question

Python

Good day. Actually, there was a need for a similar method (heappop ()) for the queue using heapq, only we return the maximum element. Maybe someone faced a similar problem.

Answer 1

original solution

Answer 2

If you just want to return the maximum element without deleting, then
if you also delete it, then nothing, because this contradicts the very structure of the prioritized queue.
If you need to have a reverse order of prioritization, then create wrappers that invert elements when inserting and deleting.