from sys import stdin
from _heapq import _heappop_max
from _heapq import _heapify_max
class PriorityQueue:
def __init__(self):
self.queue = []
def Insert(self, p):
self.queue.append(p)
_heapify_max(self.queue)
def GetMax(self):
return _heappop_max(self.queue)
def main():
queues = PriorityQueue()
reader = (tuple(line.split()) for line in stdin)
n = next(reader)
data = list(reader)
for key in data:
if key[0] == 'Insert':
queues.Insert(int(key[1]))
elif key[0] == 'ExtractMax':
print(queues.GetMax())
if __name__ == '__main__':
main()
reader = (tuple(map(str, line.split())) for line in stdin)reader = (tuple(line.split()) for line in stdin)""" Maxheap variant of heapify. """Смотрим heapify:
""" Transform list into a heap, in-place, in O(len(heap)) time. """
Простой
Простой
Простой
Простой
Простой
