Cod sursa(job #1692886)
Utilizator | Data | 21 aprilie 2016 21:45:57 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,aux,i,j,v[500001];
int main()
{
f >> n;
for(i = 1; i <= n; ++i)
f >> v[i];
for(i = 1; i <= n; ++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] << " ";
g << '\n';
return 0;
}