Is there a C++ MinMax Heap implementation?

Question

I\'m looking for algorithms like ones in the stl (push_heap, pop_heap, make_heap) except with the ability to pop both the minimum and

Answer 1

If you're looking for the algorithm implementation try searching Github.