Pagini recente » Cod sursa (job #3253402) | Cod sursa (job #494231) | Cod sursa (job #3289981) | Cod sursa (job #1816370) | Cod sursa (job #2884886)
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N=2e5+1;
int nh,h[N],poz[N],v[N];
void schimb(int p, int q)
{ swap(h[p], h[q]);
poz[h[p]]=p;
poz[h[q]]=q;
}
void urca(int p)
{ while(v[h[p]]<v[h[p/2]])
{ schimb(p, p/2);
p/=2;
}
}
void coboara(int p)
{ int fs=2*p,fd=2*p+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)
{ schimb(p, bun);
coboara(bun);
}
}
void adauga(int val)
{ h[++nh]=val;
urca(nh);
}
void sterge(int p)
{ if(p==nh)
nh--;
else
{ schimb(p, nh--);
urca(p);
coboara(p);
}
}
int main()
{ int n,cnt=0;
in>>n;
for(int i=1; i<=n; i++)
{ int op; in>>op;
if(op==1)
{ in>>v[++cnt];
poz[cnt]=cnt;
adauga(cnt);
}
if(op==2)
{ int x; in>>x;
sterge(poz[x]);
}
if(op==3)
out<<v[h[1]]<<"\n";
}
return 0;
}