Given the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street.
Return the minimum total distance between each house and its nearest mailbox.
The test cases are generated so that the answer fits in a 32-bit integer.
1 <= k <= houses.length <= 1001 <= houses[i] <= 10^4houses are uniquehouses = [1,4,8,10,20], k = 35houses = [2,3,5,12,18], k = 29