best-team-with-no-conflicts

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team.

However, the basketball team is not allowed to have conflicts. A conflict exists if a younger player has a strictly higher score than an older player. A conflict does not occur between players of the same age.

Given two lists, <code>scores</code> and <code>ages</code>, where each <code>scores[i]</code> and <code>ages[i]</code> represents the score and age of the <code>ith</code> player, respectively, return the highest overall score of all possible basketball teams.

&nbsp;
Example 1:

<pre>
Input: scores = [1,3,5,10,15], ages = [1,2,3,4,5]
Output: 34
Explanation:&nbsp;You can choose all the players.
</pre>

Example 2:

<pre>
Input: scores = [4,5,6,5], ages = [2,1,2,1]
Output: 16
Explanation:&nbsp;It is best to choose the last 3 players. Notice that you are allowed to choose multiple people of the same age.
</pre>

Example 3:

<pre>
Input: scores = [1,2,3,5], ages = [8,9,10,1]
Output: 6
Explanation:&nbsp;It is best to choose the first 3 players. 
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= scores.length, ages.length &lt;= 1000</code></li>
	<li><code>scores.length == ages.length</code></li>
	<li><code>1 &lt;= scores[i] &lt;= 106</code></li>
	<li><code>1 &lt;= ages[i] &lt;= 1000</code></li>
</ul>

bestTeamScore

Best Team With No Conflicts

Array

Dynamic Programming

Sorting

假设你是球队的经理。对于即将到来的锦标赛，你想组合一支总体得分最高的球队。球队的得分是球队中所有球员的分数 总和 。

然而，球队中的矛盾会限制球员的发挥，所以必须选出一支 没有矛盾 的球队。如果一名年龄较小球员的分数 严格大于 一名年龄较大的球员，则存在矛盾。同龄球员之间不会发生矛盾。

给你两个列表 <code>scores</code> 和 <code>ages</code>，其中每组 <code>scores[i]</code> 和 <code>ages[i]</code> 表示第 <code>i</code> 名球员的分数和年龄。请你返回 所有可能的无矛盾球队中得分最高那支的分数 。

 

示例 1：

<pre>输入：scores = [1,3,5,10,15], ages = [1,2,3,4,5]
输出：34
解释：你可以选中所有球员。</pre>

示例 2：

<pre>输入：scores = [4,5,6,5], ages = [2,1,2,1]
输出：16
解释：最佳的选择是后 3 名球员。注意，你可以选中多个同龄球员。
</pre>

示例 3：

<pre>输入：scores = [1,2,3,5], ages = [8,9,10,1]
输出：6
解释：最佳的选择是前 3 名球员。
</pre>

 

提示：

<ul>
	<li><code>1 &lt;= scores.length, ages.length &lt;= 1000</code></li>
	<li><code>scores.length == ages.length</code></li>
	<li><code>1 &lt;= scores[i] &lt;= 106</code></li>
	<li><code>1 &lt;= ages[i] &lt;= 1000</code></li>
</ul>