No comparator function present?

[knownowworld (Kaushal Tiwari)]

int main()
{
priority_queue<pair<int, int> >q;
q.push( {1, 5} );
q.push( {4, 2} );
q.push( {5, 3} );
q.push({2, 4});
q.push({3, 1});
q.push({5, 2});
cout<<q.top().first<<" "<<q.top().second<<endl;
return 0;
}

Here no comparator function present then how this heap is formed.Can’t understand please help.

[Abhinav2604 (Abhinav Singh)]

priority_queue<pair<int, int> >q;
q.push( {1, 5} );
q.push( {4, 2} );
q.push( {5, 3} );
q.push({2, 4});
q.push({3, 1});
q.push({5, 2});
cout<<q.top().first<<" "<<q.top().second<<endl;
return 0;

When we are not passing any comparator then by default the priority_queue formed has biggest element at the top. SO here we have (5,3) as the biggest element.