Maximize Distinct Elements

Problem Statement

Maximize 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 ≤ i,j 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, 4, 4, 1, 5]. Example 3 (Sample Case 1): Input: n = 3 a = [1, 2, 3] b = [4, 5, 6] k = 5 Output: 3 Explanation: The elements in a are distinct. Constraints 1 ≤ n, k ≤ 10^5 1 ≤ a[i], b[i] ≤ 10^9