#include "stdafx.h"
#include<cstdio>
#include<iostream>
#include<vector>
#include<cstring>
#include<queue>

using namespace std;
const int maxn=100;
struct node{
	int val;
	node(int val):val(val){}


};
struct cmp{
	bool operator()(node a,node b){
		return a.val<b.val;
	}
};



int main(){

	freopen("c://jin.txt","r",stdin);
	priority_queue<node,vector<node>,cmp>q;
	q.push(node(1));
	q.push(node(2));
	q.push(node(3));
	while(!q.empty()){

		cout<<q.top().val<<endl;q.pop();

	}


	freopen("CON","r",stdin);
	system("pause");
	return 0;
}