Solution: Count Pairs in Two Arrays

Statement

You are given two positive integer arrays, nums1 and nums2, both of length $n$. Your task is to count and return the number of pairs of indexes $(i, j)$ where:

• $i < j$ , and

• $\text{nums1}[i] + \text{nums1}[j] > \text{nums2}[i] + \text{nums2}[j]$

In simpler terms, the sum of two elements from nums1 must be greater than that of the corresponding elements from nums2.

Constraints:

• $n =$ ...