Cod sursa(job #305833)
| Utilizator | Data | 18 aprilie 2009 17:43:13 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main ()
{
long n,i,j;
long long a[500001],aux;
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
for (i=1; i<n; 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;
}