Leetcode 1626. Best Team With No Conflicts

Select a subset of players (max size 1000) with maximum total score under the constraint that no younger player has a strictly higher score than an older one; this is equivalent to sorting players by age (and score) and solving a weighted nondecreasing subsequence / DP on scores to find the maximum sum.