Considering a lane to be one$-$dimensional, you are

ALL provided with an array police$\_$station consisting of

$n$ distinct integers representing the coordinates of

police stations.

You, as a prosperous individual, aspire to acquire

exactly capacity distinct properties across the

entirety of this one$-$dimensional lane $($which may

be located anywhere on the number line$),$ with the

condition that they do not coincide with the

coordinates of any police station and neither any

older property acquired.

The cost associated with purchasing a property is

determined by its minimum distance from any

police station. The total cost incurred will be the

sum of costs associated with purchasing each

property.

$5,$ Here distance between $x1$ and $x2$ means the

absolute difference of $x1$ ant $dx.(=|1-2|)$

Given police$\_$station an array containing the

coordinates of the police stations, and capacity

indicates the total number of distinct properties

you can acquire. Your task is to calculate the total

minimum cost to acquire exactly the capacity

number of properties.

$24C$