Pair inside priority queue

Question

I am trying to store pairs in priority queue and I am using a compare function that compares second value of each pair.

#include
#include

        

Answer 1

This is what priority_queue looks like:

template<
    class T,
    class Container = std::vector, 
    class Compare = std::less
> class priority_queue;

In other words, CompareDist should be the third argument and the second argument should be the container (which has value_type), like the following:

priority_queue,vector>,CompareDist> pq;

Notice also, that priority_queue is what is called a "container adaptor". Another container is used as the underlying container and the priority_queue has special members functions for accessing it. Another example of a container adaptor would be std::stack.