A delivery company wants to build a new service center in a new city. The company knows the positions of all the customers in this city on a 2D-Map and wants to build the new center in a position such that the sum of the Euclidean distances to all customers is minimum.
Given an array positions where positions[i] = [x_i, y_i] is the position of the ith customer on the map, return the minimum sum of the Euclidean distances to all customers.
In other words, you need to choose the position of the service center [x_centre, y_centre] such that the following formula is minimised:
∑ sqrt((x_centre - x_i)² + (y_centre - y_i)²)
Answers within 10^-5 of the actual value will be accepted.
1 <= positions.length <= 50positions[i].length == 20 <= x_i, y_i <= 100positions = [[0,1],[1,0],[1,2],[2,1]]4.00000positions = [[1,1],[3,3]]2.82843