GreedyFlorist.java

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 GreedyFlorist {
//	https://www.hackerrank.com/challenges/greedy-florist/problem
    // Complete the getMinimumCost function below.
    static int getMinimumCost(int k, int[] c) {
        Integer sum = 0;
        int added = 0;
        Arrays.sort(c);
        int pricelevel = 1;
        for(int i = c.length-1; i>=0; i--) {
            added++;
            sum += pricelevel * c[i];
            if(added%k == 0) {
                added = 0;
                pricelevel++;
            }

        }
        return sum ;

    }

    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[] c = new int[n];

        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[i] = cItem;
        }

        int minimumCost = getMinimumCost(k, c);

        bufferedWriter.write(String.valueOf(minimumCost));
        bufferedWriter.newLine();

        bufferedWriter.close();

        scanner.close();
    }
}