You are given two integer arrays nums and multipliers of size n and m respectively, where n >= m. The arrays are 1-indexed.
You begin with a score of 0. You want to perform exactly m operations. On the ith operation (1-indexed), you will:
Choose one integer x from either the start or the end of the array nums.
Add multipliers[i] * x to your score.
Remove x from the array nums.
Return the maximum score after performing m operations.
Constraints
1 <= m <= 103
m <= n <= 105
-1000 <= nums[i], multipliers[i] <= 1000
Input
Input is in the following pattern:
n m
nums[0].........nums[n-1]
multipliers[0]............multiplier[m-1]Output
Print the maximum score after performing m operations.
Choose from the end, [1,2,3], adding 3 * 3 = 9 to the score.
Choose from the end, [1,2], adding 2 * 2 = 4 to the score.
Choose from the end, [1], adding 1 * 1 = 1 to the score.
The total score is 9 + 4 + 1 = 14.
