Pagini recente » Cod sursa (job #360579) | Cod sursa (job #524510) | Cod sursa (job #2905267) | Cod sursa (job #2447947) | Cod sursa (job #2424132)
#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int h[1000005], v[1000005], poz[1000000];
int nh;
void swapp (int p, int q)
{
swap (h[p], h[q]);
poz[h[p]] = p;
poz[h[q]] = q;
}
void urca (int p)
{
while (p>1 && v[h[p]] < v[h[p/2]])
{
swapp (p, p/2);
p/=2;
}
}
void adauga (int val)
{
h[++nh] = val;
poz[val] = nh;
urca(nh);
}
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)
{
swapp (p, bun);
coboara (bun);
}
}
void sterge (int p)
{
if (p != nh)
{
h[p] = h[nh--];
urca (p);
coboara(p);
}
else nh--;
}
int main()
{
int n;
in>>n;
for (int i=1; i<=n; i++)
{
int x, y;
in>>x;
if (x == 3) out<<h[1]<<"\n";
if (x == 1)
{
in>>y;
adauga (y);
}
if (x == 2)
{
in>>y;
sterge (poz[y]);
}
}
return 0;
}