#
#	Definicao da classe pilha de prioridade
#

import heapq

class PriorityQueue:
    def __init__(self):
        self.lstElements = []

    def empty(self):
        return (len(self.lstElements) == 0)

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]

e2356909fbc46fddaf634e86a8bb57b59d2834a2
<mask token>


class PriorityQueue:
    <mask token>
    <mask token>

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]

<mask token>


class PriorityQueue:

    def __init__(self):
        self.lstElements = []
    <mask token>

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]

<mask token>


class PriorityQueue:

    def __init__(self):
        self.lstElements = []

    def empty(self):
        return len(self.lstElements) == 0

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]

import heapq


class PriorityQueue:

    def __init__(self):
        self.lstElements = []

    def empty(self):
        return len(self.lstElements) == 0

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]

#
#	Definicao da classe pilha de prioridade
#

import heapq

class PriorityQueue:
    def __init__(self):
        self.lstElements = []

    def empty(self):
        return (len(self.lstElements) == 0)

    def put(self, item, priority):
        heapq.heappush(self.lstElements, (priority, item))

    def get(self):
        return heapq.heappop(self.lstElements)[1]
