两个数组的所有可能乘积中的第k个最大元素

import heapq

def find_kth_largest_product(nums1, nums2, k):
    nums1.sort()
    nums2.sort()
    max_heap = []
    
    for num1 in nums1:
        for num2 in nums2:
            product = num1 * num2
            heapq.heappush(max_heap, -product)
            if len(max_heap) > k:
                heapq.heappop(max_heap)
    
    return -max_heap[0]

# 示例用法
nums1 = [1, 2, 3]
nums2 = [4, 5, 6]
k = 3
result = find_kth_largest_product(nums1, nums2, k)
print(result)