1626. 无矛盾的最佳球队

class Solution:
    def bestTeamScore(self, scores: List[int], ages: List[int]) -> int:
        nums = list(zip(ages, scores))
        nums.sort()
        n = len(nums)
        dp = [num[1] for num in nums]
        for i in range(n):
            for j in range(i):
                if nums[i][1] >= nums[j][1]:
                    dp[i] = max(dp[i], dp[j] + nums[i][1])
        return max(dp)

class Solution {
    public int bestTeamScore(int[] scores, int[] ages) {
        int n = ages.length;
        int[][] nums = new int[n][2];
        for (int i = 0; i < n; ++i) {
            nums[i] = new int[] {ages[i], scores[i]};
        }
        Arrays.sort(nums, (a, b) -> { return a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]; });
        int[] dp = new int[n];
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            dp[i] = nums[i][1];
            for (int j = 0; j < i; ++j) {
                if (nums[i][1] >= nums[j][1]) {
                    dp[i] = Math.max(dp[i], dp[j] + nums[i][1]);
                }
            }
            ans = Math.max(ans, dp[i]);
        }
        return ans;
    }
}

class Solution {
public:
    int bestTeamScore(vector<int>& scores, vector<int>& ages) {
        int n = ages.size();
        vector<vector<int>> nums(n);
        for (int i = 0; i < n; ++i) nums[i] = {ages[i], scores[i]};
        sort(nums.begin(), nums.end());
        vector<int> dp(n);
        for (int i = 0; i < n; ++i) {
            dp[i] = nums[i][1];
            for (int j = 0; j < i; ++j) {
                if (nums[i][1] >= nums[j][1])
                    dp[i] = max(dp[i], dp[j] + nums[i][1]);
            }
        }
        return *max_element(dp.begin(), dp.end());
    }
};

func bestTeamScore(scores []int, ages []int) int {
	n := len(ages)
	nums := make([][]int, n)
	for i, age := range ages {
		nums[i] = []int{age, scores[i]}
	}
	sort.Slice(nums, func(i, j int) bool {
		if nums[i][0] != nums[j][0] {
			return nums[i][0] < nums[j][0]
		}
		return nums[i][1] < nums[j][1]
	})
	dp := make([]int, n)
	ans := 0
	for i, num := range nums {
		dp[i] = num[1]
		for j := 0; j < i; j++ {
			if num[1] >= nums[j][1] {
				dp[i] = max(dp[i], dp[j]+num[1])
			}
		}
		ans = max(ans, dp[i])
	}
	return ans
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

/**
 * @param {number[]} scores
 * @param {number[]} ages
 * @return {number}
 */
var bestTeamScore = function (scores, ages) {
    const nums = ages.map((age, i) => [age, scores[i]]);
    nums.sort((a, b) => (a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]));
    const n = nums.length;
    let dp = new Array(n);
    let ans = 0;
    for (let i = 0; i < n; ++i) {
        dp[i] = nums[i][1];
        for (let j = 0; j < i; ++j) {
            if (nums[i][1] >= nums[j][1]) {
                dp[i] = Math.max(dp[i], dp[j] + nums[i][1]);
            }
        }
        ans = Math.max(ans, dp[i]);
    }
    return ans;
};