input: def min_steps_to_exceed_k(k: int) -> int:
      """
      Given a positive integer k, start with an array nums = [1].
      
      You are allowed to execute any of the following actions on the array repeatedly (including zero times):
      
      Increment any element in the array by 1.
      Copy any element in the array and append it to the array.
      Determine the least number of steps needed to make the sum of the array's elements at least k.
      
      Examples:
      >>> k = 11
      5
      >>> k = 1
      0
      
      Constraints:
      1 <= k <= 10^5
      """
output:     steps = 0
      nums = [1]
      current_sum = 1
      
      while current_sum < k:
          if current_sum + current_sum <= k:
              nums.append(current_sum)
              current_sum += nums[-1]
          else:
              nums[-1] += 1
              current_sum += 1
          steps += 1
      
      return steps