#include<iostream>
#include<string>
#include<queue>
#include<time.h>
#include<algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
typedef pair<int,int>int2;
struct cmp{
bool operator() ( int2 a, int2 b ){return a.first< b.first;}
};
int main()
{
priority_queue<int2,vector<int2>,greater<int2> > p1;//小顶堆
//priority_queue<int2,vector<int2>,cmp > p1;//大顶堆
p1.push(int2(1,2));
p1.push(int2(3,4));
p1.push(int2(2,8));
p1.push(int2(5,0));
for(int i=0;i<4;i++)
{
int2 temp=p1.top();p1.pop();
printf("(%d,%d)\n",temp.first,temp.second);
}
system("pause");
return 0;
}