input: from typing import List
  
  def get_operations_to_surpass_k(nums: List[int], k: int) -> int:
      """
      Given a 0-indexed list of integers and a target value k, determine the
      minimum number of removal operations required such that every remaining
      element in the list is not less than k.
  
      In a single operation, the smallest element in the list can be removed.
  
      Return the count 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 <= nums.length <= 50
      1 <= nums[i] <= 10^9
      1 <= k <= 10^9
      There is guaranteed to be at least one element in nums that is greater than or equal to k.
      """
output:     # Sort the list in ascending order
      nums.sort()
      
      # Initialize the count of operations
      count_operations = 0
      
      # Remove elements from the beginning of the list as long as they are less than k
      while nums and nums[0] < k:
          nums.pop(0)
          count_operations += 1
      
      return count_operations