Question

pbinfo problema #86

Answer 1

#include <iostream>

#include <fstream>

using namespace std;

ifstream f("halfsort.in");

ofstream g("halfsort.out");

int v[101], n, mij, i, j;

int main()

{

  f >> n;

  for (i=1; i<=n; ++i)

     f >> v[i];

  mij=n/2;

  for (i=1; i<mij; ++i)

   for (j=i+1; j<=mij; ++j)

       if (v[j]<v[i]) swap(v[i], v[j]);

  for (i=mij+1; i<n; ++i)

    for (j=i+1; j<=n; ++j)

       if (v[j]>v[i]) swap(v[i], v[j]);

  for (i=1; i<=n; ++i)

   g << v[i] << " ";

}