# HackerRank The Hurdle Race problem solution

In this HackerRank The Hurdle Race problem you need to complete the hurdleRace function that has an integer variable and an integer array as a parameter and needs to return a minimum number of doses required by a player.

## Problem solution in Python programming.

```#!/bin/python3

import sys

n,k = input().strip().split(' ')
n,k = [int(n),int(k)]
height = list(map(int, input().strip().split(' ')))
count=0
for i in height:
if i>k:
count+=i-k
k=i
print(count)```

## Problem solution in Java Programming.

```import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int[] height = new int[n];
int max = 0;
for(int height_i=0; height_i < n; height_i++){
height[height_i] = in.nextInt();
if ( height[height_i] > max){
max = height[height_i] ;
}
}
if(k >= max){
System.out.println("0");

}
// y
else{
System.out.println(max-k);
}
}
}```

### Problem solution in C++ programming.

```#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main(){
int n;
int k;
cin >> n >> k;
int res = 0;
vector<int> height(n);
for(int height_i = 0; height_i < n; height_i++){
cin >> height[height_i];
if (height[height_i] > k) { res += -k + height[height_i]; k = height[height_i]; }
}
printf("%d\n", res);
return 0;
}```

### Problem solution in C programming.

```#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
int n;
int k;
scanf("%d %d",&n,&k);
int h, mh = 0;
for(int height_i = 0; height_i < n; height_i++){
scanf("%d", &h);
if (h > mh) mh = h;
}

printf("%d\n", k < mh ? mh - k : 0);
return 0;
}```

### Problem solution in JavaScript programming.

```process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
input_stdin += data;
});

process.stdin.on('end', function () {
input_stdin_array = input_stdin.split("\n");
main();
});

return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function main() {
var n = parseInt(n_temp[0]);
var k = parseInt(n_temp[1]);
height = height.map(Number);