Cod sursa(job #289354)
Utilizator | Data | 26 martie 2009 18:16:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
unsigned long i,j,n,aux;
long v[500000];
int main()
{f>>n;
for (i=1;i<=n;i++)
f>>v[i];
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (v[i]>v[j])
{aux=v[i];
v[i]=v[j];
v[j]=aux;}
for (i=1;i<=n;i++)
g<<v[i];
f.close();
g.close();
return 0;}