Append K Integers With Minimal Sum
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.
Example 1
Input
nums = [1,4,25,10,25], k = 2Output
5The two unique positive integers appended are 2 and 3, and their sum is 5.
Example 2
Input
nums = [5,6], k = 6Output
25The six unique positive integers appended are 1, 2, 3, 4, 7, and 8, and their sum is 25.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^9
- 1 <= k <= 10^8