input: Write a Python function that, given a list of integers and a target value k, calculates the minimum number of operations required to ensure that all numbers in the list are at least k. An operation consists of removing the smallest number in the list.
  from typing import List
  
  def minimum_removals(nums: List[int], k: int) -> int:
      """
      You have an integer array nums and an integer k.
  
      In every single operation, you can eliminate the smallest element from nums.
  
      The function should return the smallest number of operations required to make all elements of the array nums greater than or equal to 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 <= len(nums) <= 50
      1 <= nums[i] <= 10^9
      1 <= k <= 10^9
      The input guarantees there is at least one index i such that nums[i] >= k.
      """
output: def minimum_removals(nums: List[int], k: int) -> int:
      nums.sort()
      count = 0
      for num in nums:
          if num >= k:
              break
          count += 1
      return count