Just do it

input/code.cpp: In function 'int median(int, int, int)':
input/code.cpp:19:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   19 |     if (a >= b >= c)
      |         ~~^~~~
input/code.cpp:21:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   21 |     if (c >= b >= a)
      |         ~~^~~~
input/code.cpp:23:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   23 |     if (b >= a >= c)
      |         ~~^~~~
input/code.cpp:25:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   25 |     if (c >= a >= b)
      |         ~~^~~~
input/code.cpp:27:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   27 |     if (a >= c >=b)
      |         ~~^~~~
input/code.cpp:29:11: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   29...

// Sort an array. Initialize with low = 0 and high = len(array)
#include <vector>
#include <string>
#include <iostream>
#include <cmath>

using namespace std;


int count = 0;

void swap(vector<int>&array, int a, int b){
    int aux = array[b];
    array[b] = a;
    array[a] = aux;
}

int median(int a, int b, int c){
    if (a >= b >= c)
        return b;
    if (c >= b >= a)
        return b;
    if (b >= a >= c)
        return a;
    if (c >= a >= b)
        return a;
    if (a >= c >=b)
        return c;
    if (b >= c >= a)
        return c;
}

void HiitSort(vector<int>& array, int low,int  high){
    if (high - low > 1)
    {
        int pivot = median(array[low], array[(low + high) / 2], array[high - 1]);

        int a = low;
        int b = high - 1;
        while (true){
            while (array[a] < pivot){
                a = a + 1;
                count++;
            }
            while (array[b] > pivot) {
                b = b - 1;
                count++;
            }
            if (a >= b)
                break;
            swap(array, a, b);
            a = a + 1;
            b = b - 1;
        }

        HiitSort(array, low, a);
        HiitSort(array, a, high);
    }
}

int main(){
    int n;
    cin >> n;
    vector<int> array = vector<int>(n);
    for (int i = 0; i < n; ++i)
        cin >> array[i];
    HiitSort(array, 0, n);

    cout << count << endl;
    if (count >= (n *n)/4)
        cout << "YES"<<endl;
    else 
        cout <<"NO" << endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER