Kth Smallest Product of Two Sorted Arrays LeetCode solution in Python

1
class Solution:
2
    def kthSmallestProduct(self, nums1: List[int], nums2: List[int], k: int) -> int:
3
        result = []
4
        for i in range(len(nums1)):
5
            for j in range(len(nums2)):
6
                temp = nums1[i] * nums2[j]
7
                result.append(temp)
8
        result.sort()
9
        return result[k - 1]