Elegant Python-Achieve a minimalist priority queue

A queue satisfies a minimum of 2 methods, put and get.

Implemented with minimal heap.

This is the order in which the higher the value priority is.

#coding =utf-8from HEAPQ Import Heappush, Heappopclass priorityqueue:    def __init__ (self):        self._queue = []    def put (self, item, priority):        Heappush (Self._queue, (-priority, item))    def get (self):        return Heappop ( Self._queue) [ -1]q = Priorityqueue () q.put (' World ', 1) q.put (' Hello ', 2) print q.get () print q.get ()

Elegant Python-Achieve a minimalist priority queue