You are given an integer array nums and an integer k. Append k unique positive integers that do not appear in nums to nums such that the resulting total sum is minimum.
Return the sum of the k integers appended to nums.
1 <= nums.length <= 10^51 <= nums[i] <= 10^91 <= k <= 10^8nums = [1,4,25,10,25], k = 25nums = [5,6], k = 625