Cod sursa(job #1712002)
| Utilizator | Data | 1 iunie 2016 19:24:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[500005];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++ i)
fin >> v[i];
for(int i = 1; i <= n; ++ i)
for(int j = i + 1; j <= n; ++ j)
if(v[i] > v[j])
swap(v[i], v[j]);
for(int i=1;i<=n/2; i++ )
swap(v[i], v[n-i+1]);
for(int i=1; i<=n; i++)
fout<<v[i]<<" ";
}
