Problem 2736 · Hard

Maximum Sum Queries

For each query, find the largest nums1[i] + nums2[i] among indices where nums1[i] is at least x and nums2[i] is at least y.

Open the interactive visualisation