Strange operations

Given an array consisting of N integers, you have to do the following operation K times. - Find out the sum of all the elements in the array. Denote it by S. Insert an integer in the array strictly greater than S. Hence, size of the array will increase by one. Thus, at the end of the K operations, the array will have N + K elements. Find out the smallest possible value of the last number inserted