input: from typing import List
  
  def min_steps_to_exceed(nums: List[int], k: int) -> int:
      """
      Given a list of integers and a threshold value k, determine the fewest number of removals of the smallest element needed such that all remaining numbers are at least k.
  
      Examples:
      >>> nums = [2,11,10,1,3], k = 10
      3
      >>> nums = [1,1,2,4,9], k = 1
      0
      >>> nums = [1,1,2,4,9], k = 9
      4
  
      Constraints:
      1 <= nums.length <= 50
      1 <= nums[i] <= 10^9
      1 <= k <= 10^9
      There is at least one element in nums that is greater than or equal to k.
      """
output:     nums.sort()
      removals = 0
      while nums and nums[0] < k:
          nums.pop(0)
          removals += 1
      return removals