-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathPriyankaAndToys.java
More file actions
53 lines (41 loc) · 1.39 KB
/
PriyankaAndToys.java
File metadata and controls
53 lines (41 loc) · 1.39 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
53
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 PriyankaAndToys {
// https://www.hackerrank.com/challenges/priyanka-and-toys/problem
// Complete the toys function below.
static int toys(int[] w) {
Arrays.sort(w);
int minWeight = w[0]+4;
int containerCount = 1;
for(int i = 0; i<w.length;i++) {
if(w[i]>minWeight) {
containerCount++;
minWeight = w[i]+4;
}
}
return containerCount;
}
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")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] w = new int[n];
String[] wItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int wItem = Integer.parseInt(wItems[i]);
w[i] = wItem;
}
int result = toys(w);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}