Question

Monica has cooked N dishes and collected the data on the level of satisfaction
for all the dishes from a guest. The guest returns an array, where
the ith element of the array is the liking level of the ith dish. Also, the time taken
to cook the ith dish is i.
Like-to-time coefficient of a dish is calculated by multiplying the time taken to
cook food with its liking level, i.e., Minput2[i]. Total Like-to-time coefficient is
calculated by summing up all individual coefficients of dishes.
You want the total Like-to-time coefficient to be maximum. You can also remove
some dishes, in which case, a new coefficient is calculated using the left
dishes.
Find the maximum sum of all possible Like-to-time coefficients.

i need answer in java prompt ​

Answer 1

Explanation:

this question has mistake in it