def METHOD_NAME(self):
    # Removes and returns the min element at top of priority queue
    min_node = self.array[0][1]
    self.array[0] = self.array[self.cur_size - 1]
    self.cur_size -= 1
    self.min_heapify(1)
    del self.pos[min_node]
    return min_node