2736. Maximum Sum Queries

解題說明

C++ 解法

複雜度分析

虛擬碼

1. Sort indices by nums1 descending
2. Sort queries by xi descending (keep original index)
3. Initialize empty monotonic stack
4. For each query (xi, yi) in descending xi order:
   a. Add all elements with nums1[j] >= xi to stack
      - Maintain: stack sorted by nums2 ascending, sum descending
      - Remove dominated entries (smaller nums2 AND smaller sum)
   b. Binary search stack for first entry with nums2 >= yi
   c. If found, answer = that entry's sum; else -1
5. Return answers in original query order

其他解法

延伸思考