Dev - C++ - Formar un arreglo de positivos y negativos por el método de burbuja

#include <iostream>

using namespace std;

const int n = 23;

int main() {

  int x[n] = {2,-9,7,6,-3,-1,4,6,2,6,-1,2,4,8,5,-4,4,6,1,-3,1,-3,8};

  int y[n] = {};

  int z[n] = {};

  int i,j=0,k=0;

  for (i=0; i<n; i++) {

    if (x[i] < 0) {

      y[j] = x[i];

      j++;

    }

    else {

      z[k] = x[i];

      k++;

    }

  }

  //mostrar vectores

  for (i=0; i<j; i++) {

    cout << y[i] << " ";

  }

  cout << endl;

  for (i=0; i<k; i++) {

    cout << z[i] << " ";

  }

  return 0;

}

#include <iostream>

#include  <vector>

#include <algorithm>

using namespace std;

int main() {

  vector<int> x = {2,-9,7,6,-3,-1,4,6,2,6,-1,2,4,8,5,-4,4,6,1,-3,1,-3,8};

  vector<int> y;

  vector<int> z;

  for (auto i : x) {

    if (i < 0) {

      y.push_back(i);

    }

    else {

      z.push_back(i);

    }

  }

  for (auto i : y)

    cout << i << " ";

    cout << endl;

    for (auto i : z)

    cout << i << " ";

    //ordenado

    cout << "\n\nVectores ordenados";

    cout << endl;

    sort(y.begin(),y.end());

    for (auto x : y)

        cout << x << " ";

    cout << endl;

    sort(z.begin(),z.end());

    for (auto x : z)

        cout << x << " ";

  return 0;

}