I understand that the std::priority queue class implements a minheap.
Is it possible to utilise this as a Max heap?
Or is there another Maxheap structure?
I know I can construct my own Maxheap by using the std::make heap() function on a std::vector with lambda, but utilising functions like std::pop heap() is strange and I don't believe they're simple to use.
I believe there could be a simpler solution, similar to the min heap(priority queue).