- Question 1
Consider two arrays of integers, a[n] and b[n]. What is the maximum number of pairs that can be formed where a[i] > b[j]? Each element can be in no more than one pair.
Find the maximum number of such possible pairs.
Example
n = 3
a = [1, 2, 3]
b = [1, 2, 1]
Two ways the maximum number of pairs can be selected:
- {a[1], b[0]} = {2, 1} and {a[2], b[2]} = {3, 1} are valid pairs.
- {a[1], b[0]} = {2, 1} and {a[2], b[1]} = {3, 2} are valid pairs.
No more than 2 pairs can be formed, so return 2.
Function Description
Complete the function findNumOfPairs in the editor below.
findNumOfPairs has the following parameters:
- int a[n]: an array of integers
- int b[n]: an array of integers
Returns
- int: the maximum number of pairs possible
Constraints
- 1 ≤ n ≤ 10^5
- 1 ≤ a[i] ≤ 10^9
我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。
We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.
