stl make_heap_通过使用make_heap（）创建堆| C ++ STL

stl make_heap

What is Heap Data structure?

什么是堆数据结构？

Heap is a tree-based which is used for fast retrieval of largest (max heap) or smallest (min heap) element. This DS is used in the priority queue, prims algo, heap sort and many more.

堆是基于树的，用于快速检索最大(最大堆)或最小(最小堆)元素。 该DS用于优先级队列，原始算法，堆排序等。

make_heap()函数 (make_heap() function)

Syntax:

句法：

    make_heap( arg1, agr2 ,[arg3]) 

Here,

这里，

• arg1 = pointer or iterator to starting of the number list

  arg1 =指向数字列表开头的指针或迭代器

• arg2