Cod sursa(job #2193408)
| Utilizator | Data | 9 aprilie 2018 23:41:44 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
char const in [] = "algsort.in";
char const out [] = "algsort.out";
ifstream f (in);
ofstream g (out);
int const NM = 500007;
int v [NM];
int main()
{
int n , i , j;
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])
{
int aux = v [i];
v [i] = v [j];
v [j] = aux;
}
for(i = 1 ; i <= n ; ++ i)
g << v [i] << ' ' ;
return 0;
}
