QuickSort_v1

#include <cmath>
#include <iostream>
#include <vector>

using std::cin;
using std::cout;
using std::max;
using std::min;
using std::string;
using std::vector;

void swap(int* p1, int* p2) {
  int t = *p1;
  *p1 = *p2;
  *p2 = t;
}


vector<int> Partition(vector<int> aa, int xx) {
  //делим на < и >=
  int nn = aa.size();
  int ll = -1;
  for (int ii = 0; ii < nn; ++ii) {
    if (aa[ii] < xx) {
      int* p1 = &aa[ii];
      int* p2 = &aa[ll + 1];
      swap(p1, p2);
      ll++;
    }
  }
  //делим на = и >
  for (int ii = ll + 1; ii < nn; ++ii) {
    if (aa[ii] == xx) {
      int* p1 = &aa[ii];
      int* p2 = &aa[ll + 1];
      swap(p1, p2);
      ll++;
    }
  }
  return aa;
}

int get_med(vector<int> vv) {
  for (int ii = 0; ii < 5; ++ii) {
    for (int jj = 0; jj < 4; ++jj) {
      if (vv[jj] > vv[jj + 1]) {
        int* p1 = &vv[jj];
        int* p2 = &vv[jj + 1];
        swap(p1, p2);
      }
    }
  }
  return vv[2];
}

int inf = 2e9;

vector<int> DQS(vector<int> aa) {};

int QuickSelect(vector<int> med) {
  while (med.size() % 5 != 0) {
    med.push_back(inf);
  }
  vector<int> new_med;
  for (int ii = 0; ii < med.size(); ii += 5) {
    vector<int> vv = {med[ii], med[ii + 1], med[ii + 2], med[ii + 3], med[ii + 4]};
    new_med.push_back(vv[2]);
  }
  if (new_med.size() == 1) {
    return new_med[0];
  }
  new_med = DQS(new_med);
  int res = QuickSelect(new_med);
  return res;
}

vector<int> DQS()





int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  int nn;
  cin >> nn;
  vector <int> aa(nn);
  for (int& ii: aa) {
    cin >> ii;
  }
  int xx;
  cin >> xx;
  aa = Partition(aa, xx);
  for (int ii: aa) {
    cout << ii << ' ';
  }
  cout << "\n";
}
/*
17
2 2 0 2 1 2 0 2 1 0 2 1 2 2 0 0 2
1
*/