Task: Find the Kth Smallest Element in the Union of Two Sorted Arrays

Task: Find the Kth Smallest Element in the Union of Two Sorted Arrays: a task in Terminal-Lego-15k (Harbor dataset). Implement a time-efficient algorithm to find the kth smallest element in the union of two sorted arrays.