input: from typing import List
  
  def remove_min_elements(nums: List[int], k: int) -> int:
      """
      Given a 0-indexed integer array nums and an integer k.
  
      In each operation, you can eliminate one instance of the smallest element in nums.
  
      Compute the minimum number of operations required so that every element in the array is 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
      The input is generated to ensure at least one index i satisfies nums[i] >= k.
      """
output:     operations = 0
      nums.sort()
      
      for num in nums:
          if num >= k:
              break
          operations += 1
      
      return operations