#include

using namespace std;

vector split_string(string);

// Complete the equalizeArray function below.

int equalizeArray(vector arr) {

}

int main()

{

ofstream fout(getenv("OUTPUT_PATH"));

int n;

cin >> n;

cin.ignore(numeric_limits::max(), ' ');

string arr_temp_temp;

getline(cin, arr_temp_temp);

vector arr_temp = split_string(arr_temp_temp);

vector arr(n);

for (int i = 0; i

int arr_item = stoi(arr_temp[i]);

arr[i] = arr_item;

}

int result = equalizeArray(arr);

fout

fout.close();

return 0;

}

vector split_string(string input_string) {

string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {

return x == y and x == ' ';

});

input_string.erase(new_end, input_string.end());

while (input_string[input_string.length() - 1] == ' ') {

input_string.pop_back();

}

vector splits;

char delimiter = ' ';

size_t i = 0;

size_t pos = input_string.find(delimiter);

while (pos != string::npos) {

splits.push_back(input_string.substr(i, pos - i));

i = pos + 1;

pos = input_string.find(delimiter, i);

}

splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

return splits;

}

Karl has an array of integers. He wants to reduce the array until all remaining elements are equal. Determine the minimum number of elements to delete to reach his goal. For example, if his array is arr = [1,2,2,3), we see that he can delete the 2 elements 1 and 3 leaving arr = 2,2). He could also delete both twos and either the 1 or the 3, but that would take 3 deletions. The minimum number of deletions is 2. Function Description Complete the equalizeArray function in the editor below. It must return an integer that denotes the minimum number of deletions required. equalizeArray has the following parameter(s): arr: an array of integers Input Format The first line contains an integer n, the number of elements in arr. The next line contains n space-separated integers arri). Constraints 1<>