You are given two integer arrays, scores and ages, of identical length, where scores[i] and ages[i] represent the score and age of the $i^{ ext{th}}$ player, respectively.

You wish to choose a team that achieves the maximum possible total score. A conflict arises if a younger player has a strictly higher score than an older player. No conflict exists between players who share the same age.

Return the highest overall score achievable by choosing a valid team with no conflicts.

Constraints:

• $1 \leq$ scores.length, ages.length $\leq 1000$

• scores.length $==$ ages.length

• $1 \leq$ scores[i] $\leq 10^6$

• $1 \leq$ ages[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.