Pagini recente » Cod sursa (job #249854) | Cod sursa (job #3282919) | Cod sursa (job #1977621) | Cod sursa (job #3265679) | Cod sursa (job #1767841)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int h[100000], val[100000];
int nh;
void schimba(int p, int q)
{
int aux = h[p];
h[p] = h[q];
h[q] = aux;
}
void coboara(int p)
{
int fs = 2*p, fd = 2*p + 1, bun = p;
if(fs <= nh && h[val[fs]] < h[val[bun]]) bun = fs;
if(fd <= nh && h[val[fd]] < h[val[bun]]) bun = fd;
if(bun != p)
{
schimba(bun,p);
coboara(bun);
}
}
void urca(int p)
{
while(p != 1 && val[h[p]] < val[h[p/2]] )
{
schimba(p, p/2);
p /= 2;
}
}
void adauga(int val1)
{
h[++nh] = val1;
urca(nh);
}
void sterge(int p)
{
schimba(p, nh--);
urca(p);
coboara(p);
}
int main()
{
int i, n,b, m = 0;
f >> n;
for(i = 1; i <= n ; i++)
{
int a;
//nh++;
f >> a;
if(a == 1)
{
f >> b;
m++;
val[m] = b;
adauga(m);
}
if(a == 2)
{
f >> b;
int semafor = 1, j = 1;
while(semafor)
{
if(h[j] == b)
semafor = 0;
else
j++;
}
sterge(j);
}
if(a == 3)
g << val[h[1]] << '\n';
}
}