Cod sursa(job #358364)
Utilizator | Data | 22 octombrie 2009 21:10:33 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long long a[500000],n,i,p,aux;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
for(p=1;p<=n;p++)
for(i=1;i<=n;i++)
if(a[i-1]>a[i]) {aux=a[i];
a[i]=a[i-1];
a[i-1]=aux;
}
for(i=1;i<=n;i++) g<<a[i]<<" ";
f.close();
g.close();
return 0;
}