Cod sursa(job #865139)
Utilizator | Data | 26 ianuarie 2013 02:14:47 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[500000],aux,i;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
for(i=1;i<=n;++i)
if(v[i]<v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
}
for(i=1;i<=n;++i)
g<<v[i]<<" ";
return 0;
}