求最大加权子集，使得子集中的任意两个元素之和不等于k

def max_weighted_subset(nums, weights, k):
    n = len(nums)
    dp = [[float('-inf')] * (k+1) for _ in range(n+1)]
    dp[0][0] = 0

    for i in range(1, n+1):
        for j in range(k+1):
            dp[i][j] = max(dp[i-1][j], dp[i-1][j-nums[i-1]] + weights[i-1]) if j != k else dp[i-1][j]

    max_weight = max(dp[n][j] for j in range(k+1) if j != k)
    return max_weight

# 示例输入
nums = [1, 2, 3, 4, 5]
weights = [1, 2, 3, 4, 5]
k = 6

max_weight = max_weighted_subset(nums, weights, k)
print("最大加权子集的权值和为:", max_weight)