Given two sorted arrays `nums1` and `nums2` of size `m` and `n` respectively and an int `k`. Find the `k-th` largest element of these arrays.\nNote that it is the `k-th` largest element in the sorted order, not the `k-th` distinct element.\n\n**Example 1:**\n```\nInput: nums1 = [-2, -1, 3, 5, 6, 8], nums2 = [0, 1, 2, 5, 9], k = 4\nOutput: 5\nExplanation: Union of above arrays will be [-2, -1, 0, 1, 2, 3, 5, 5, 6, 8, 9] and the 4th largest element is 5.\n```\n\n**Example 2:**\n```\nInput: nums1 = [2, 4], nums2 = [6], k = 1\nOutput: 6\nExplanation: union of above arrays will be [2, 4, 6] and the 1st largest element is 6.\n```\n\nYou may assume `k` is always valid, `1 \u2264 k \u2264 m + n`.\n\n<details> \n  <summary>Follow-up</summary>\n\nCan you do it in O(logk) time?\n</details>\n

Given two sorted arrays nums1 and nums2 of size m and n respectively and an int k. Find the k-th largest element of these arrays.\nNote that it is the k-th larg