Leetcode 2195. Append K Integers With Minimal Sum

Pick k distinct positive integers not in nums so their sum is minimized — equivalently, find and sum the k smallest positive integers missing from nums. Because nums and k can be large, the typical approach identifies gaps in the sorted unique nums and uses arithmetic-range sums to accumulate the k smallest missing values efficiently.