Cod sursa(job #1336511)
| Utilizator | Data | 7 februarie 2015 20:23:20 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n,i,j;
long long a[500001],aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
f>>n;
for (i=1; i<=n; i++) f>>a[i];
for (i=1; i<=n-1; i++) for (j=i+1; j<=n; j++) if (a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for (i=1; i<=n; i++) g<<a[i]<<' ';
return 0;
}
