Given houses and k mailboxes, find min total distance. Input: JSON {houses,k}.
Input: JSON {houses,k}.
Output: Integer.
Input: {"houses":[1,4,8,10,20],"k":3}
Output: 5
Explanation: Optimal 3 mailboxes.Input: {"houses":[2,3,5,12,18],"k":2}
Output: 9
Explanation: Optimal 2 mailboxes.Input: {"houses":[1],"k":1}
Output: 0
Explanation: One house.1<=n<=1001<=houses[i]<=10^41<=k<=n