1060. Missing Element in Sorted Array

First define a function f(x) that counts the number of missing elements until x.

Then use binary search with the given function f(x) to find the kth missing element.