Determine the Minimum Sum of a k-avoiding Array

Choose n distinct positive integers with no two summing to k and minimize their total; the core challenge is to construct the smallest possible set while never including both x and k−x (solvable by a simple greedy selection).