Minimum Total Space Wasted With K Resizing Operations

You are given an integer array nums and an integer k. You need to resize the array exactly k times. Resizing the array means to pick up the first k elements, drop them to the end of the array, and insert the picked elements at the beginning of the array. The space wasted with resizing is defined as the sum of differences between the actual size of the array and the number of elements it contains. Return the minimum total space wasted with k resizing operations.