1. Create a binary heap class in python.
2.The Heap class should have a limited heap size.(the heap only keeps track of the n most important items)
3. pass the max heap size in the constructor. (If an element gets added to the heap that makes it grow to a size larger than its max heap size then the least important item is dropped.i.e the oldest element in the heap)