Leetcode 3478. Choose K Elements With Maximum Sum

For each index i, compute the maximum sum obtainable by picking up to k values from nums2 at indices j where nums1[j] < nums1[i]. The core challenge is answering these top-k sum queries efficiently for all i (e.g., by processing indices in order of nums1 and maintaining the current top-k nums2 values).