Cod sursa(job #1326203)
Utilizator | Data | 24 ianuarie 2015 21:18:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long v[5000005];
int main()
{ ifstream f("algsort.in");
ofstream g("algsort.out");
long long n, i, aux, j;
f>>n;
for (i=1;i<=n;++i)
f>>v[i];
for (i=1;i<=n;++i)
for (j=i+1;j<=n;++j)
if (v[j]<v[i])
{ aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for (i=1;i<=n;++i)
g<<v[i]<<' ';
return 0;
}