Leetcode 3065. Minimum Operations to Exceed Threshold Value I

Given an array nums and threshold k, repeatedly remove the current smallest element until every remaining value is >= k; return the minimum number of removals required (equivalently, the count of elements strictly less than k, with the guarantee at least one element >= k).