forked from sknsht/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
50 lines (34 loc) · 1.32 KB
/
Solution.java
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
import java.io.*;
import java.util.*;
public class Solution {
// Complete the getMinimumCost function below.
static int getMinimumCost(int k, ArrayList<Integer> c) {
int minCost = 0;
int numPurchased = 0;
Collections.sort(c, Collections.reverseOrder());
for (int i = 0; i < c.size(); i++) {
if (i % k == 0) numPurchased++;
minCost += numPurchased * c.get(i);
}
return minCost;
}
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]);
ArrayList<Integer> c = new ArrayList();
String[] cItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int cItem = Integer.parseInt(cItems[i]);
c.add(cItem);
}
int minimumCost = getMinimumCost(k, c);
bufferedWriter.write(String.valueOf(minimumCost));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}