Partition array into k subsets

Question

We are given an array and a number K. Partition array into K subsets such that

let MaxSum be the maximum sum of among subsets.

We have to minimize summation =$$\sum_{i=1}^{k}MaxSum-sum(i) $$

Is this problem polynimial time solvable?