Pagini recente » Cod sursa (job #820235) | Cod sursa (job #1697756) | Cod sursa (job #1045199) | Cod sursa (job #3184128) | Cod sursa (job #2310199)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int aib[2000010],v[500001];
int poz,N,i;
int fiu_stang(int nod)
{
return (2*nod);
}
int fiu_drept(int nod)
{
return (2*nod+1);
}
void Adaugare(int nod,int st,int dr,int poz,int val)
{
int mij=st+(dr-st)/2;
if(st>=dr)
{
aib[nod]=poz;
return;
}
if(poz<=mij)
{
Adaugare(fiu_stang(nod),st,mij,poz,val);
}
else
{
Adaugare(fiu_drept(nod),mij+1,dr,poz,val);
}
if(v[aib[fiu_stang(nod)]]<v[aib[fiu_drept(nod)]])
{
aib[nod]=aib[fiu_stang(nod)];
}
else
{
aib[nod]=aib[fiu_drept(nod)];
}
}
void citire_construire()
{
fin>>N;
for(i=1;i<=N;i++)
{
fin>>v[i];
Adaugare(1,1,N,i,v[i]);
}
}
int main()
{
citire_construire();
for(i=1;i<N;i++)
{
poz=aib[1];
fout<<v[poz]<<' ';
v[poz]=2147483647;
Adaugare(1,1,N,poz,v[poz]);
}
fout<<v[aib[1]];
fin.close();
fout.close();
return 0;
}