GFG PTOD | 19 Dec | Kth Missing Positive Number in a Sorted Array

int kthMissing(vector<int> &arr, int k) {
        // Your code goes here
        int low = 0;
        int high = arr.size()-1;
        int ans = arr.size() + k;
        while(low <= high) {
            int mid = low + (high-low) / 2;
            if(arr[mid] > mid+k) {
                high = mid - 1;
                ans = mid + k;
            } else {
                low = mid+1;
            }
        }
        return ans;
    }