If the smallest number in the possible-to-split array is V, then numbers V+1, V+2, ... V+k-1 must contain there as well.

You can iteratively find k sets and remove them from array until it becomes empty.

Failure to do so would mean that array is unsplittable.