Pagini recente » Cod sursa (job #2398583) | Cod sursa (job #2476678) | Cod sursa (job #2937455) | Cod sursa (job #2759552) | Cod sursa (job #1766752)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[100], h[100];
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[fs] < h[bun]) bun = fs;
if(fd <= nh && h[fd] < h[bun]) bun = fd;
if(bun != p)
{
schimba(bun,p);
coboara(bun);
}
}
void urca(int p)
{
while(p != 1 && h[p] < h[p/2])
{
schimba(p, p/2);
p /= 2;
}
}
void adauga(int val)
{
h[++nh] = val;
urca(nh);
}
void sterge(int p)
{
schimba(p, nh--);
urca(p);
coboara(p);
}
int main()
{
int i, n;
f >> n;
for(i = 1; i <= n ; i++)
{
int a;
//nh++;
f >> a;
adauga(a);
}
n = 0;
while(nh != 0)
{
v[++n] = h[1];
sterge(1);
}
for(i = 1; i <= n ; i++)
g << v[i] << " ";
}