
'''
This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm.
The interesting property of a heap is that its smallest element is always the root, heap[0].


https://docs.python.org/2/library/heapq.html


'''

import heapq

data=[10,2,5,7,8,9,10]
print data
heapq.heapify(data)
print data
print heapq.heappop(data)


