Given an array arr[] of N integers, the task is to find an element x from the array such that |arr[0] – x| + |arr[1] – x| + |arr[2] – x| + … + |arr[n – 1] – x| is minimized, then print the minimized sum.
Examples:
Input: arr[] = {1, 3, 9, 3, 6}
Output: 11
The optimal solution is to choose x = 3, which produces the sum
|1 – 3| + |3 – 3| + |9 – 3| + |3 – 3| + |6 – 3| = 2 + 0 + 6 + 0 + 3 = 11Input: arr[] = {1, 2, 3, 4}
Output: 4
A simple solution is to iterate through every element and check if it gives optimal solution or not. Time Complexity of this solution is O(n*n)
An Efficient Approach: is to always pick x as the median of the array. If n is even and there are two medians then both the medians are optimal choices. The time complexity for the approach is O(n * log(n)) because the array will have to be sorted in order to find the median. Calculate and print the minimized sum when x is found (median of the array).
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the minimized sum int minSum(int arr[], int n) { // Sort the array sort(arr, arr + n); // Median of the array int x = arr[n / 2]; int sum = 0; // Calculate the minimized sum for (int i = 0; i < n; i++) sum += abs(arr[i] - x); // Return the required sum return sum; } // Driver code int main() { int arr[] = { 1, 3, 9, 3, 6 }; int n = sizeof(arr) / sizeof(arr[0]); cout << minSum(arr, n); return 0; } |
Java
// Java implementation of the approach import java.util.*; class GFG { // Function to return the minimized sum static int minSum(int arr[], int n) { // Sort the array Arrays.sort(arr); // Median of the array int x = arr[(int)n / 2]; int sum = 0; // Calculate the minimized sum for (int i = 0; i < n; i++) sum += Math.abs(arr[i] - x); // Return the required sum return sum; } // Driver code public static void main(String args[]) { int arr[] = { 1, 3, 9, 3, 6 }; int n = arr.length; System.out.println(minSum(arr, n)); } } // This code is contribute by // Surendra_Gangwar |
Python3
# Python3 implementation of the approach # Function to return the minimized sum def minSum(arr, n) : # Sort the array arr.sort(); # Median of the array x = arr[n // 2]; sum = 0; # Calculate the minimized sum for i in range(n) : sum += abs(arr[i] - x); # Return the required sum return sum; # Driver code if __name__ == "__main__" : arr = [ 1, 3, 9, 3, 6 ]; n = len(arr) print(minSum(arr, n)); # This code is contributed by Ryuga |
C#
// C# implementation of the approach using System; class GFG { // Function to return the minimized sum static int minSum(int []arr, int n) { // Sort the array Array.Sort(arr); // Median of the array int x = arr[(int)(n / 2)]; int sum = 0; // Calculate the minimized sum for (int i = 0; i < n; i++) sum += Math.Abs(arr[i] - x); // Return the required sum return sum; } // Driver code static void Main() { int []arr = { 1, 3, 9, 3, 6 }; int n = arr.Length; Console.WriteLine(minSum(arr, n)); } } // This code is contributed by mits |
11
The time complexity of the above solution is O(n Log n). We can further optimize it to work in O(n) using linear time algortihm to find k-th largest element.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Array formed using sum of absolute differences of that element with all other elements
- Minimum sum of differences with an element in an array
- Sum of minimum absolute difference of each array element
- Minimum and Maximum sum of absolute differences of pairs
- Sum of absolute differences of all pairs in a given array
- Sum of absolute differences of pairs from the given array that satisfy the given condition
- Count elements in first Array with absolute difference greater than K with an element in second Array
- Clustering/Partitioning an array such that sum of square differences is minimum
- Minimum elements to be inserted in Array to make adjacent differences equal
- Count of all pairs in an Array with minimum absolute difference
- Minimum absolute difference of adjacent elements in a circular array
- Minimum value of maximum absolute difference of all adjacent pairs in an Array
- Missing occurrences of a number in an array such that maximum absolute difference of adjacent elements is minimum
- Check if minimum element in array is less than or equals half of every other element
- Sum of (maximum element - minimum element) for all the subsets of an array.
- Minimum distance between the maximum and minimum element of a given Array
- Replace elements with absolute difference of smallest element on left and largest element on right
- Remove exactly one element from the array such that max - min is minimum
- Sum of minimum element of all sub-sequences of a sorted array
- Sum and Product of minimum and maximum element of an Array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
