c: C ++ priority queue / priority_queue (maximum heap, minimum heap)

ref

https://blog.csdn.net/geter_CS/article/details/102580332

note

定义： priority_queue<int,vector,less> q;最大堆（默认为最大堆）
priority_queue<int,vector,greater> q;最小堆
Priority queues are a type of container adaptors, specifically designed such that its first element is always the greatest of the elements it contains, according to some strict weak ordering criterion.

This context is similar to a heap, where elements can be inserted at any moment, and only the max heap element can be retrieved (the one at the top in the priority queue).

The underlying container（第二个参数） may be any of the standard container class templates or some other specifically designed container class. The container shall be accessible through random access iterators and support the following operations:

empty()
size()
front()
push_back()
pop_back()

Magical less: function obj

http://www.cplusplus.com/reference/functional/less/