2736 - Maximum Sum Queries\.

Hard

You are given two 0-indexed integer arrays nums1 and nums2, each of length n, and a 1-indexed 2D array queries where <code>queriesi = x_i, y_i</code>.

For the <code>i^th</code> query, find the maximum value of nums1[j] + nums2[j] among all indices j (0 <= j < n), where <code>nums1j>= x_i</code> and <code>nums2j>= y_i</code>, or \-1 if there is no j satisfying the constraints.

Return an array answer where answer[i] is the answer to the <code>i^th</code> query.

Example 1:

Input: nums1 = 4,3,1,2, nums2 = 2,4,9,5, queries = \[\[4,1],1,3,2,5]

Output: 6,10,7

Explanation:

For the 1st query <code>x_i = 4</code> and <code>y_i = 1</code>, we can select index j = 0 since nums1[j] >= 4 and nums2[j] >= 1. The sum nums1[j] + nums2[j] is 6, and we can show that 6 is the maximum we can obtain.

For the 2nd query <code>x_i = 1</code> and <code>y_i = 3</code>, we can select index j = 2 since nums1[j] >= 1 and nums2[j] >= 3. The sum nums1[j] + nums2[j] is 10, and we can show that 10 is the maximum we can obtain.

For the 3rd query <code>x_i = 2</code> and <code>y_i = 5</code>, we can select index j = 3 since nums1[j] >= 2 and nums2[j] >= 5. The sum nums1[j] + nums2[j] is 7, and we can show that 7 is the maximum we can obtain.

Therefore, we return [6,10,7].

Example 2:

Input: nums1 = 3,2,5, nums2 = 2,3,4, queries = \[\[4,4],3,2,1,1]

Output: 9,9,9

Explanation: For this example, we can use index j = 2 for all the queries since it satisfies the constraints for each query.

Example 3:

Input: nums1 = 2,1, nums2 = 2,3, queries = \[\[3,3]]

Output: -1

Explanation: There is one query in this example with <code>x_i</code> = 3 and <code>y_i</code> = 3. For every index, j, either nums1j<<code>x_i</code> or nums2j<<code>y_i</code>. Hence, there is no solution.

Constraints:

• nums1.length == nums2.length

• n == nums1.length

• <code>1 <= n <= 10⁵</code>

• <code>1 <= nums1i, nums2i<= 10⁹</code>

• <code>1 <= queries.length <= 10⁵</code>

• queries[i].length == 2

• <code>x_i == queries1</code>

• <code>y_i == queries2</code>

• <code>1 <= x_i, y_i<= 10⁹</code>