12345678910111213141516171819202122232425262728293031323334353637383940414243

import java.util.*;
class Solution {
    // Function to return k largest valid sum combinations
    public List<Integer> maxCombinations(int[] nums1, int[] nums2, int k) {

        // List to store all possible pair sums
        List<Integer> allSums = new ArrayList<>();

        // Iterate through each element in nums1
        for (int i = 0; i < nums1.length; i++) {

            // Iterate through each element in nums2
            for (int j = 0; j < nums2.length; j++) {

                // Store the sum of the pair
                allSums.add(nums1[i] + nums2[j]);
            }
        }

        // Sort all sums in descending order
        allSums.sort(Collections.reverseOrder());

        // Return the first k sums
        return allSums.subList(0, k);
    }
}

// Driver class
public class Main {
    public static void main(String[] args) {
        Solution obj = new Solution();
        int[] nums1 = {7, 3};
        int[] nums2 = {1, 6};
        int k = 2;

        List<Integer> result = obj.maxCombinations(nums1, nums2, k);
        for (int val : result) {
            System.out.print(val + " ");
        }
        System.out.println();
    }
}

123456789101112131415161718192021222324252627282930

class Solution:

    # Function to return k largest valid sum combinations
    def maxCombinations(self, nums1, nums2, k):

        # List to store all possible pair sums
        all_sums = []

        # Iterate through each element in nums1
        for i in range(len(nums1)):

            # Iterate through each element in nums2
            for j in range(len(nums2)):

                # Add the sum of the pair to the list
                all_sums.append(nums1[i] + nums2[j])

        # Sort the list in descending order
        all_sums.sort(reverse=True)

        # Return the first k elements
        return all_sums[:k]

# Driver code
nums1 = [7, 3]
nums2 = [1, 6]
k = 2
obj = Solution()
print(obj.maxCombinations(nums1, nums2, k))  # Output: [13, 9]

12345678910111213141516171819202122232425262728293031323334

class Solution {

    // Function to return k largest valid sum combinations
    maxCombinations(nums1, nums2, k) {

        // A