There are $$$ n $$$ people who are living in their own houses $$$ h_1, h_2, h_3 \dots , h_n $$$ located on the X-axis. A boy who can move with a speed of $$$ 1 unit/sec $$$, needs to visit all the houses. We need to find the minimum waiting time of the people (sum of waiting time of all the people)?
The initial position of the boy is $$$ x $$$
$$$ Constraints : 1 \lt = n \lt = 1000, -10^6 \lt = h_i , x \lt = 10^6 $$$
From live contest?
No
There are two possible ways to go to every person optimally. Either go to complete right and then left or the opposite. Check whichever is min
You should minimize sum not maximum. Try on this scenario:
Consider $$$ x = 10 $$$ and houses at $$$ 1, 9, 11, 19 $$$
the correct answer is $$$ 44 $$$