Envío 1407

Código

#include <iostream>
#include <vector>
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> input(n);
  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }

  // Selection sort
  vector<int> output(n);
  int next = 0;
  int alive = n;
  while (next < n) {
    // Find the smallest element among the elements that are alive.
    int best = 0;
    for (int i = 1; i < alive; i++) {
      if (input[i] < input[best]) {
        best = i;
      }
    }
    // Here, input[best] is the smallest one.
    output[next] = input[best];

    // Delete element at position best.
    swap(input[best], input[alive-1]);
    alive--;

    next++;
  }

  for (int i = 0; i < n; i++) {
    if (i > 0) cout << " ";
    cout << output[i];
  }
  cout << endl;

  return 0;
}