实现一棵Bernoulli树。实现下列操作：

1.insert X，将整数X加入优先队列

2.delete，将优先队列中最小值弹出

3.min，输出最小值

初始优先队列为空。(Implement a Bernoulli tree. The following operations are implemented:



1.insert X, adding integer X to the priority queue



2.delete, the minimum value in the priority queue is popped out



3.min, output minimum



The initial priority queue is empty.)