Cod sursa(job #1146273)
Utilizator | Data | 18 martie 2014 20:40:32 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.84 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500001],n,i,x,j,k;
f>>n;
int m=1,d;
for(i=1;i<=n;i++)
{
f>>x;
if(i==1)
{
v[i]=x;
m++;
}
else
{
if(x>v[m-1])
{
v[m]=x;
m++;
}
else
{
for(j=1;j<=m;j++)
if(x<=v[j])
{
for(d=m;d>=j;d--)
v[d+1]=v[d];
v[j]=x;
m++;
break;
}
}
}
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}