给定两个正整数的无序列表，最大化A[i]*B[i] + A[i]*B[j] + A[j]*B[j]，i != j

def maximize_product(list1, list2):
    max_val = float('-inf')
    second_max_val = float('-inf')

    for num in list1 + list2:
        if num > max_val:
            second_max_val = max_val
            max_val = num
        elif num > second_max_val:
            second_max_val = num

    result = 0
    for i in range(len(list1)):
        result += max_val * list2[i] + list1[i] * second_max_val + list1[i] * list2[i]

    return result

# 示例输入
list1 = [3, 1, 5]
list2 = [2, 4, 6]

# 调用函数并输出结果
print(maximize_product(list1, list2))