TheHurdleRace.cpp

#include <bits/stdc++.h>
#include <vector>
#include <algorithm>

using namespace std;

vector <string> split_string(string);

// Complete the hurdleRace function below.
int hurdleRace(int k, vector<int> height)
{

    auto maxHeight = *std::max_element(std::begin(height), std::end(height));

    return maxHeight < k ? 0 : maxHeight - k;

}

int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string nk_temp;
    getline(cin, nk_temp);

    vector <string> nk = split_string(nk_temp);

    int n = stoi(nk[0]);

    int k = stoi(nk[1]);

    string height_temp_temp;
    getline(cin, height_temp_temp);

    vector <string> height_temp = split_string(height_temp_temp);

    vector<int> height(n);

    for (int i = 0; i < n; i++)
    {
        int height_item = stoi(height_temp[i]);

        height[i] = height_item;
    }

    int result = hurdleRace(k, height);

    fout << result << "\n";

    fout.close();

    return 0;
}

vector <string> 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 <string> 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;
}