#include<iostream>
#include<stdio.h>
#include<queue>
using namespace std;
struct node
{
int i,j;
node(int ii,int jj)
{
i=ii;
j=jj;
}
bool operator <(const node& a) const
{
return i<a.i;
}
};
int main()
{
priority_queue<pair<int ,int> > q;
q.push(make_pair(2,3));
q.push(make_pair(2,5));
q.push(make_pair(4,6));
for(int i=1;i<=3;i++)
{
pair<int,int> tem=q.top();
q.pop();
cout<<tem.first<<" "<<tem.second<<endl;
}
priority_queue<node> p;
p.push(node(2,5));
p.push(node(2,3));
p.push(node(4,6));
for(int i=1;i<=3;i++)
{
node tem=p.top();
cout<<tem.i<<" "<<tem.j<<endl;
p.pop();
}
}