A chef has collected data on the satisfaction levels of n dishes, given in an integer array satisfaction.

The chef can cook any dish in $1$ unit of time. The like-time coefficient of a dish is defined as the time taken to cook that dish (including all previous dishes) multiplied by its satisfaction level, which equals time $ imes$ satisfaction[i].

Dishes can be prepared in any chosen order, and the chef is allowed to discard any number of dishes to maximize the total value.

Return the maximum sum of the like-time coefficient that the chef can achieve after preparing the dishes.

Constraints:

• n $==$ satisfaction.length

• $1 \leq$ n $\leq 500$

• $-1000 \leq$ satisfaction[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.