mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
42 lines
1.6 KiB
HTML
42 lines
1.6 KiB
HTML
<p>A chef has collected data on the <code>satisfaction</code> level of his <code>n</code> dishes. Chef can cook any dish in 1 unit of time.</p>
|
|
|
|
<p><strong>Like-time coefficient</strong> of a dish is defined as the time taken to cook that dish including previous dishes multiplied by its satisfaction level i.e. <code>time[i] * satisfaction[i]</code>.</p>
|
|
|
|
<p>Return the maximum sum of <strong>like-time coefficient </strong>that the chef can obtain after preparing some amount of dishes.</p>
|
|
|
|
<p>Dishes can be prepared in <strong>any </strong>order and the chef can discard some dishes to get this maximum value.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> satisfaction = [-1,-8,0,5,-9]
|
|
<strong>Output:</strong> 14
|
|
<strong>Explanation:</strong> After Removing the second and last dish, the maximum total <strong>like-time coefficient</strong> will be equal to (-1*1 + 0*2 + 5*3 = 14).
|
|
Each dish is prepared in one unit of time.</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> satisfaction = [4,3,2]
|
|
<strong>Output:</strong> 20
|
|
<strong>Explanation:</strong> Dishes can be prepared in any order, (2*1 + 3*2 + 4*3 = 20)
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> satisfaction = [-1,-4,-5]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> People do not like the dishes. No dish is prepared.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == satisfaction.length</code></li>
|
|
<li><code>1 <= n <= 500</code></li>
|
|
<li><code>-1000 <= satisfaction[i] <= 1000</code></li>
|
|
</ul>
|