Leetcode 1402. Reducing Dishes

Given an array of integer satisfaction levels (which may be negative), choose a subset and order of dishes—each taking 1 unit time—to maximize the like-time coefficient sum, defined as sum(time_i * satisfaction_i) with time_i = 1,2,...; return the maximum achievable total.