Minimal price to make each Kth ingredient in Array equal

Given an array arr[] of integers and an integer Ok, the duty is to search out the minimal variety of operations required to make each Ok^th ingredient within the array equal. Whereas performing one operation you may both enhance a quantity by one or lower the quantity by one.

Examples:

Enter: arr[] = {1, 2, 3, 4, 4, 6}, Ok = 3
Output: 8
Rationalization: For the given array, worth of Ok = 3 which implies each third ingredient within the array ought to be equal. So we have now to make 1 = 4, 2 = 4 and three = 6. So by performing 3 operations on 1 we are able to make it equal to 4 (or vice versa it is going to take identical variety of operations) and a couple of operations for making 2 and 4 equal and three operations to make 6 and three equal .So whole variety of operations is 8 which is the minimal price to make each third ingredient in array equal.

Enter: {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, Ok = 3
Output: 24
Rationalization: Worth of Ok = 3, so each third ingredient ought to be equal which implies we have now to make 1 = 4 = 7 = 10, 2 = 5 = 8 and three = 6 = 9. For making 1 = 4 = 7 = 10, the minimal price will likely be 12 and for making 2 = 5 = 8, the minimal price will likely be 6 and for making 3 = 6 = 9, the minimal price will likely be 6. So for making each third ingredient of array equal we have now to carry out minimal 24 operations.

Strategy: To resolve the issue comply with the beneath concept:

We have to discover common of each Ok^th ingredient after which discover distinction between the Ok^th ingredient and common.

This might be applied by following beneath talked about steps:

• Initialize an array say common of dimension ok for calculating the typical of each Ok^th ingredient.
• Iterate over the enter array after which calculate the typical of each ok^th ingredient.
• Initialize a variable say, minCost. Iterate over the enter array and add absolutely the distinction of arr[i] and common[i%k], minCost += abs(arr[i] – common[i % k]).

Beneath is the implementation of the above method:

Time Complexity: O(N)
Auxiliary House: O(ok) //For the array which was initialized for calculating the typical.