how is the priority queue sorted on in cpp code example

Example: how to store pair in min heap in c++

typedef pair<int, int> pi;
priority_queue<pi, vector<pi>, greater<pi> > pq;