The default stl priority queue is a Max one (Top function returns the largest element).
Say, for simplicity, that it is a priority queue of int values.
In C++11 you could also create an alias for convenience:
template using min_heap = priority_queue, std::greater>;
And use it like this:
min_heap my_heap;