C++ stl

I want to implement priority queue using STL.
Basically I want to use it for storing states(array of size k) sorted according cost.
Which standard template is useful for me?

I want to implement Insert, GetMin(based on cost), Isempty operations on the priority queue.
Any help syntax would also be very helpful.

Quote:

---

Originally Posted by anirban

I want to implement priority queue using STL.
Basically I want to use it for storing states(array of size k) sorted according cost.
Which standard template is useful for me?

I want to implement Insert, GetMin(based on cost), Isempty operations on the priority queue.
Any help syntax would also be very helpful.

---

Just wrap a std::set in your class, providing the right comparator functions.

Quote:

---

Originally Posted by anirban

I want to implement priority queue using STL.
Basically I want to use it for storing states(array of size k) sorted according cost.
Which standard template is useful for me?

---

You can use the std::priority_queue container adapter.

By default, it uses heap operations like std::make_heap, std::push_heap and std::pop_heap on an internal std::vector.

Any syntax help for implementing min heap please?
I am new to this and need to know the syntax.

As in you just want help in implementing a min heap? If so, what have you tried?

The 4th and 5th links here look like they would be very useful to you:
Let me google that for you