最大优先队列是基于堆的思想来实现的，相应的插入、删除、以及对优先队列的维护都是通过堆的思想来实现的-Maximum priority queue is a heap-based thinking to achieve, corresponding insertion, deletion, and maintenance for the priority queue heap ideas through to achieve