Problem Statement
Maximum Distinct Elements Problem Description Consider two arrays, a and b, each containing n integers. You can perform the following operation at most k times: Select two indices, i and j (0 a = [1, 1, 3, 5, 5] and b = [4, 4, 4, 1, 5]. Swap a[0] and b[1] -> a = [4, 1, 3, 5, 5] and b = [4, 1, 4, 1, 5]. The resulting array a has distinct elements {1, 3, 4, 5}, for a total of 4. Constraints 1 <= n, k <= 10^5 1 <= a[i], b[i] <= 10^9