Minimum and Maximum Cost to buy N Candies
Ram went to a specialty candy store in Ninjaland which has 'N' candies with different costs.

The Candy shop gives a special offer to its customers. A customer can buy a single candy from the store and get at most 'K' different candies for free. Now, Ram is interested in knowing the maximum and the minimum amount he needs to spend for buying all the candies available in the store.

Note: In both cases, Ram must utilize the offer i.e. if 'K' or more candies are available, he must take 'K' candies for every candy purchase. If less than K candies are available, he must take all candies for a candy purchase.

For Example :

For 'N' = 5 and 'K' = 2 Let the cost of different candies in the store be: [9 8 2 6 4] For the minimum amount: Ram can buy a candy with cost 2 and take candies with costs 9 and 8 for free. Then, he can buy a candy with cost 4 and take candy with cost 7 for free. Thus, the minimum cost will be 6 i.e. 2 + 4. For the maximum amount: Ram can buy a candy with cost 9 and take candies with costs 2 and 6 for free. Then, he can buy candy at cost 8 and take candy at cost 4 for free. Thus, the minimum cost will be 17 i.e. 9 + 8. Thus, Minimum = 6 and Maximum = 17.

Input format :

The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then, the 'T' test cases follow. The first line of each test case or query contains two space-separated integers 'N' and ‘K’ representing the number of candies available and the number of candies you get free for a single purchase respectively. The second line of each test case contains 'N' single space-separated integers, representing the costs of the candies.

Output format:

For each test case, print two space-separated integers 'A' and 'B' where 'A' is the minimum amount and 'B' is the maximum amount in which Ram can buy all the candies.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1

Question

Minimum and Maximum Cost to buy N Candies

Ram went to a specialty candy store in Ninjaland which has 'N' candies with different costs.

The Candy shop gives a special offer to its customers. A customer can buy a single candy from the store and get at most 'K' different candies for free. Now, Ram is interested in knowing the maximum and the minimum amount he needs to spend for buying all the candies available in the store.

Note: In both cases, Ram must utilize the offer i.e. if 'K' or more candies are available, he must take 'K' candies for every candy purchase. If less than K candies are available, he must take all candies for a candy purchase.

For Example :

For 'N' =  5 and 'K' = 2

Let the cost of different candies in the store be: [9 8 2 6 4]

For the minimum amount: 
Ram can buy a candy with cost 2 and take candies with costs 9 and 8 for free. 
Then, he can buy a candy with cost 4 and take candy with cost 7 for free. 
Thus, the minimum cost will be 6 i.e. 2 + 4. 

For the maximum amount: 
Ram can buy a candy with cost 9 and take candies with costs 2 and 6 for free. 
Then, he can buy candy at cost 8 and take candy at cost 4 for free. 
Thus, the minimum cost will be 17 i.e. 9 + 8.

Thus, Minimum = 6 and Maximum = 17.

Input format :

The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then, the 'T' test cases follow.

The first line of each test case or query contains two space-separated integers 'N' and ‘K’ representing the number of candies available and the number of candies you get free for a single purchase respectively.

The second line of each test case contains 'N' single space-separated integers, representing the costs of the candies.

Output format:

For each test case, print two space-separated integers 'A' and 'B' where 'A' is the minimum amount and 'B' is the maximum amount in which Ram can buy all the candies.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1 <= 'T' <= 5
1 <= 'N' <= 10^5
0 <= 'K' < N
1 <= 'COST' <= (10^9) 

Where 'T' is the number of test cases, 'N' is the number of candies, 'K' is a type of candies and 'COST' is the cost of candies.

Time limit: 1 sec

Accepted Answer

First Sort the price array. For finding the minimum amount start purchasing candies from starting and reduce k free candies from last with every single purchase. For finding the maximum amount start purchasing candies from the end and reduce k free candies from starting in every single purchase.

Accepted Answer

Using Sorting

Let us apply the way that for minimum cost, Ram buys the candy with minimum cost and then takes top 'K' expensive candies for free.

Similarly, for maximum cost, Ram buys the candy with maximum cost and then takes the top 'K' cheapest candies for free.

For Minimum:
- Sort the cost array in increasing order.
  Now, until the candies are available:
  → Start picking candies from the left i.e. the cheapest one.
  → Add the cost of the picked candy in a variable say, 'MINCOST'.
  → Drop 'K' candies from the right as you get them for free.
  Return 'MINCOST'.
For Maximum:
- Sort the cost array in decreasing order.
  Now, until the candies are available:
  → Start picking candies from the left i.e. the one with maximum cost.
  → Add the cost of the picked candy in a variable say, 'MAXCOST'.
  → Drop 'K' candies from the right as you get them for free.
  Return 'MAXCOST'.

Space Complexity: O(1)Explanation:

O(1).

In the worst case, constant extra space is used.

Time Complexity: O(nlogn)Explanation:

O(N * logN), where ‘N’ is the number of candies in the store.

In the worst case, we are sorting the ‘COST’ array which takes N * logN time.

Accepted Answer

Using Priority-Queue

The idea is to use a priority queue.

Firstly, we need to calculate M i.e. the number of candies that are to be actually bought, M can be calculated simply as:
Ceil[ N/(K+1) ] as Ram gets K+1 candies at one purchase where 1 candy is bought by Ram and K candies are free.

For Example: For N = 8 and K = 2, when Ram buys one candy he gets 2 candies for free, so, in one buy he gets 3 (2+1) candies, so, total purchases required to buy all the 8 candies are Ceil[ 8 / 3] = 3.
The idea is basically that for the minimum cost, take M cheapest candies and for the maximum cost take M costliest candies.
For the minimum cost, create a min priority queue containing the costs of all the candies and then pick top M elements.
Similarly for maximum cost, create a max priority queue containing the costs of all the candies and then pick top M elements.

Space Complexity: O(n)Explanation:

O(N), where ‘N’ is the number of candies in the store.

In the worst case, we are creating a priority queue of size ‘N’.

Time Complexity: OtherExplanation:

O(N + M * log(N)), where ‘N’ is the number of candies in the store and 'M' is the number of candies for which Ram has to pay.

In the worst case, the time analysis is as follows:

O(N) for building the priority queue.

O(M * logN) for popping top M elements from the queue containing N integers.