input: from typing import List
  
  def min_removals(nums: List[int], k: int) -> int:
      """
      Given a list of integers called nums and an integer k, this function aims to find the minimum number of operations required so that every element in nums is at least k.
  
      In each operation, you can remove the smallest element in nums.
  
      Return the smallest number of such operations needed.
  
      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 is guaranteed to have at least one element in nums that is greater than or equal to k.
      """
output:     
      nums.sort()
      operations = 0
      while nums and nums[0] < k:
          nums.pop(0)
          operations += 1
      return operations
  