Maximize Y-Sum by Picking a Triplet of

lcpy gen -n 3572   # by problem number
lcpy gen -s maximize_ysum_by_picking_a_triplet_of_distinct_xvalues   # by problem name

Input: x = [1,2,1,3,2], y = [5,3,4,6,2]
Output: 14
Explanation: Choose i = 0 (x[i] = 1, y[i] = 5), j = 1 (x[j] = 2, y[j] = 3), k = 3 (x[k] = 3, y[k] = 6). All three values chosen from x are distinct. 5 + 3 + 6 = 14 is the maximum we can obtain.

Input: x = [1,2,1,2], y = [4,5,6,7]
Output: -1
Explanation: There are only two distinct values in x. Hence, the output is -1.

class Solution:
    # Time: O(n)
    # Space: O(n)
    def max_sum_distinct_triplet(self, x: list[int], y: list[int]) -> int:
        best: dict[int, int] = {}
        for xi, yi in zip(x, y, strict=True):
            if yi > best.get(xi, 0):
                best[xi] = yi
        if len(best) < 3:
            return -1
        return sum(sorted(best.values(), reverse=True)[:3])