Normal queue is a FIFO data structure, the tail elements added, deleted HOL.
Priority queue dequeue logic compared to the normal queue has changed, with the highest priority elements of the first team.
In C ++ contains even #include <queue> can use the priority queue data structure The priority_queue ;
Priority queue contains all the ordinary operation of the queue. On this basis, only adds automatic sorting inside, the underlying implementation is a heap .
To be added
======================================================
Related Links:
C ++ priority queue description: https://www.cnblogs.com/huashanqingzhu/p/11040390.html
Priority Queue Usage: https://blog.csdn.net/LOVETEDA/article/details/90580395