Max Cost Permutation : DP Bitmask

#1

Can you please explain what we need to do in the question with the following array as example : { 1000, 1001, 2000}

#2

@aman2382000
You just need to sort the array
Then calculate i*arr[i] where i { 0 , N-1 }

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.