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