Cod sursa(job #2861562)
Utilizator | Morosanu Alexandru alexmorosanu | Data | 4 martie 2022 09:29:50 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int a[500011],n;
void insus(int k)
{
if(k==1)
return;
if(a[k]<a[k/2])
{
swap(a[k],a[k/2]);
insus(k/2);
}
}
void injos(int k)
{
int x=k*2;
if(x>n)
return;
if(x+1<=n && a[x+1]<a[x])
x++;
if(a[k]>a[x])
{
swap(a[k],a[x]);
injos(x);
}
}
int m,i;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
insus(i);
}
m=n;
for(i=1;i<=m;i++)
{
g<<a[1]<<" ";
a[1]=a[n];
n--;
injos(1);
}
return 0;
}