Cod sursa(job #958288)
| Utilizator | Data | 7 iunie 2013 14:54:00 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int a[500002], n, i, aux, ok=0, b[500002];
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int main()
{
cin>>n;
for(i=1; i<=n; i++)
{
cin>>a[i];
}
while(ok=1)
{
for(i=1; i<=n; i++)
{if(a[i]<a[i+1])
b[i]=a[i];
else b[i]=a[i+1];
}
}
for(i=1; i<=n; i++)
{cout<<b[i];
}
cin.close();
cout.close();
return 0;
}
