Please finish the python code.

lass Topkeap: \# Function: Delete top k delete an element from the array A \# In particular delete the j{th} element where j=0 means the least element. \# j must be in range 0 to self. k1 def delete top_k(self, j): k= self.k assert self.size ()>k \# we need not handle the case when size is less than or equal to assert j>=0 assert j