The underlying implementation of the priority queue is the heap (heap) (operating system process scheduling)

In the case of only one CPU, such as a scheduler in the operating system, when a job is completed, it is necessary to select one of the highest priority jobs to execute (delete) in all the jobs waiting to be dispatched, and you can add a new job to the priority queue (insert) of the job.

Insert operation

The insert operation is to insert an element into the tail of the queue, and then perform a "float" operation (adjusted to heap)

Delete operation

Priority queue, removes the first element in the collection, the element with the subscript 0, and then moves the last element in the collection to the subscript 0 position in the queue non-empty, performing a "sinking" operation on the new element labeled 0

The underlying implementation of the priority queue is the heap (heap) (operating system process scheduling)