Pagini recente » Cod sursa (job #1279663) | Cod sursa (job #2747076) | Cod sursa (job #1719876) | Cod sursa (job #1182053) | Cod sursa (job #2294818)
#include <iostream>
#include <fstream>
using namespace std;
int N,Heap[200001],poz[200001];
void swap(int &a,int &b)
{
int aux=a;
a=b;
b=aux;
}
void adaugare(int x,int Heap[])
{
N++;
Heap[N]=x;
int k=N;
while(k!=0 && Heap[tata(k)]>Heap[k])
{
swap(Heap[tata(k)],Heap[k]);
poz[Heap[k]]=x;
poz[Heap[tata(k)]=x/2;
k=tata(k);
}
}
void stergere(int x,int Heap[])
{
int aux, y = 0;
while (x != y)
{
y = x;
swap(Heap[x],Heap[y]);
poz[Heap[x]] = x;
poz[Heap[y]] = y;
}
}
int minim(int Heap[])
{
return Heap[1];
}
int tata(int nr)
{
return nr/2;
}
int fiu_stang(int nr)
{
return nr*2;
}
int fiu_drept(int nr)
{
return nr*2+1;
}
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int i,k,x;
cin>>N;
for(i=1;i<=N;i++)
{
cin>>k;
if(k==1 || k==2)
{
cin>>x;
if(k==1)
{
adaugare(x,Heap);
}
else
{
stergere(x,Heap);
}
}
else
{
cout<<minim(Heap)<<' ';
}
}
fin.close();
fout.close();
return 0;
}