import heapq
 
pole = [2,7,26,25,19,17,1,90,3,36]
 
heapq.heapify(pole) #vytvorenie haldy v case O(n)
print(pole)
 
print(heapq.heappop(pole)) #odstranenie minima
print(pole)
 
#HeapSort - usporiadanie haldovanim
pole = [2,7,26,25,19,17,1,90,3,36]
heapq.heapify(pole) #vytvorenie haldy v case O(n)
vysl = []
for _ in range(len(pole)):
	#print(heapq.heappop(pole), end=" ") #vypis prvok a medzeru (nie koniec riadku)
	vysl.append(heapq.heappop(pole))
print(*vysl) #vypise medzerou oddelene (rozbali zoznam - unpacking list)

aW1wb3J0IGhlYXBxCgpwb2xlID0gWzIsNywyNiwyNSwxOSwxNywxLDkwLDMsMzZdCgpoZWFwcS5oZWFwaWZ5KHBvbGUpICN2eXR2b3JlbmllIGhhbGR5IHYgY2FzZSBPKG4pCnByaW50KHBvbGUpCgpwcmludChoZWFwcS5oZWFwcG9wKHBvbGUpKSAjb2RzdHJhbmVuaWUgbWluaW1hCnByaW50KHBvbGUpCgojSGVhcFNvcnQgLSB1c3BvcmlhZGFuaWUgaGFsZG92YW5pbQpwb2xlID0gWzIsNywyNiwyNSwxOSwxNywxLDkwLDMsMzZdCmhlYXBxLmhlYXBpZnkocG9sZSkgI3Z5dHZvcmVuaWUgaGFsZHkgdiBjYXNlIE8obikKdnlzbCA9IFtdCmZvciBfIGluIHJhbmdlKGxlbihwb2xlKSk6CgkjcHJpbnQoaGVhcHEuaGVhcHBvcChwb2xlKSwgZW5kPSIgIikgI3Z5cGlzIHBydm9rIGEgbWVkemVydSAobmllIGtvbmllYyByaWFka3UpCgl2eXNsLmFwcGVuZChoZWFwcS5oZWFwcG9wKHBvbGUpKQpwcmludCgqdnlzbCkgI3Z5cGlzZSBtZWR6ZXJvdSBvZGRlbGVuZSAocm96YmFsaSB6b3puYW0gLSB1bnBhY2tpbmcgbGlzdCk=