-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathTheHurdleRace.java
More file actions
52 lines (37 loc) · 1.31 KB
/
TheHurdleRace.java
File metadata and controls
52 lines (37 loc) · 1.31 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class TheHurdleRace {
// Complete the hurdleRace function below.
static int hurdleRace(int k, int[] height) {
Arrays.sort(height);
if(k >= height[height.length-1]){
return 0;
}else{
return height[height.length-1] - k;
}
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String[] nk = scanner.nextLine().split(" ");
int n = Integer.parseInt(nk[0]);
int k = Integer.parseInt(nk[1]);
int[] height = new int[n];
String[] heightItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int heightItem = Integer.parseInt(heightItems[i]);
height[i] = heightItem;
}
int result = hurdleRace(k, height);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}