Cod sursa(job #1259175)
Utilizator | Data | 9 noiembrie 2014 19:41:28 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
long long n,v[500001];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
int aux;
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
{
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=v[i];
}
}
for(int i=1;i<=n;++i)
g<<v[i]<<' ';
g<<'\n';
g.close();
return 0;
}