Pagini recente » Cod sursa (job #1746325) | Cod sursa (job #2081380) | Cod sursa (job #1459438) | Cod sursa (job #2241161) | Cod sursa (job #2453782)
#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int Q=200500;
int v[Q],poz[Q],h[Q],nh;
void schimba(int a,int b){
int aux,aux1;
aux=h[a];
h[a]=h[b];
h[b]=aux;
poz[h[a]]=a;
poz[h[b]]=b;
}
void coboara(int p){
int fs=p*2,fd=p*2+1,bun=p;
if(fs<=nh&&v[h[fs]]<v[h[bun]]) bun=fs;
if(fd<=nh&&v[h[fd]]<v[h[bun]]) bun=fd;
if(bun!=p){
schimba(bun,p);
coboara(bun);
}
}
void urca(int p){
while(v[h[p]]<v[h[p/2]]&&p>1){
schimba(p,p/2);
p/=2;
}
}
void adauga(int x,int nr)
{
h[++nh]=nr;
poz[nr]=nh;
urca(nh);
}
void sterge(int p)
{
schimba(nh--,p);
urca(p);
coboara(p);
}
int main()
{
int n,cod,x,nr=0;
in>>n;
for(int i=1;i<=n;i++){
in>>cod;
if(cod==1)
{
in>>v[++nr];
adauga(v[nr],nr);
}
if(cod==2)
{
in>>x;
sterge(poz[x]);
}
if(cod==3)
{
out<<v[h[1]]<<endl;
}
}
return 0;
}