Determine the Minimum Sum of a k-avoiding Array
You are given two integers, n and k.
An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.
Return the minimum possible sum of a k-avoiding array of length n.
Example 1
Input
n = 5, k = 4Output
18Consider the k-avoiding array [1, 2, 4, 5, 6], which has a sum of 18, and it can be proven that no k-avoiding array has a smaller sum.
Example 2
Input
n = 2, k = 6Output
3We can construct the array [1, 2], which has a sum of 3, and it can be proven that no k-avoiding array has a smaller sum.
Constraints
- 1 <= n, k <= 50