#include <iostream>
#include <ctime>
#include <math.h>
using namespace std;
template <class T> class MinHeap{
	private:
		int heapsize,len;
		T **A;
	public:
		MinHeap(int x){
			heapsize=0;
			len=x+1;
			A=new T*[len];
		}
		MinHeap(T V[], int x){
			heapsize=x;
			len=heapsize+1;
			A = new T*[len];
			for(int i=1;i<=heapsize;i++){
				A[i]=new T(V[i-1]);
			}
		}
		void swap(int a,int b){
			T*tmp=A[a];
			A[a]=A[b];
			A[b]=tmp;
		}
		void heapify(int i){
			if(i>heapsize) return;

			int sx=2*i;
			int dx=2*i+1;
			int v=i;
			if(sx<=heapsize && *A[sx]<*A[i]) v=sx;
			if(dx<=heapsize && *A[dx]<*A[v]) v=dx;
			if(v==i) return;
			swap(v,i);
			heapify(v);
		}

		void BuildHeap(){
			for(int i=heapsize/2;i>0;i--) heapify(i);
		}
		void print(){
			for (int i=1;i<=heapsize;i++){
				cout<<*A[i]<<" ";
			}
		}
		void sort(){
			int n=heapsize;
			for(int i=0;i<=heapsize;i++) extract();
			heapsize=n;
		}
		void extract(){
			if(heapsize==0) return;
			swap(1,heapsize);
			heapsize--;
			heapify(1);
		}
		void ins(T x){
			if(heapsize==len-1) {
				cout<<"Pieno\n";
				return;
			}
			heapsize++;
			A[heapsize]= new T (x);
			int i=heapsize;
			while(i>1 && *A[i]<*A[i/2]){
				swap(i/2,i);
				i=i/2;
			}
		}

};
int main(){

//	int v[]={3,1,5,0};
	MinHeap<int>*M=new MinHeap<int>(4);
	M->ins(3);
	M->ins(1);
	M->ins(5);
	M->ins(0);
	//M->sort();
	M->print();

}