3065. Minimum Operations to Exceed Threshold Value I

You are given a 0-indexed integer array nums, and an integer k.

In one operation, you can remove one occurrence of the smallest element of nums.

Return the minimum number of operations needed so that all elements of the array are greater than or equal to k.

class Solution {
public:
    int minOperations(vector<int>& A, int k) {
        sort(begin(A), end(A));
        for(int i = 0; i < A.size(); i++) {
            if(A[i] >= k) return i;
        }
        return A.size();
    }
};