Problem Statement

AWS provides scalable systems. A set of n servers are used for horizontally scaling an application. The goal is to have the computational power of the servers in non-decreasing order. To do so, you can increase the computational power of each server in any contiguous segment by x . Choose the values of x such that after the computational powers are in non-decreasing order, the sum of the x values is minimum. Example There are n = 5 servers and their computational power = [3, 4, 1, 6, 2]. Add 3 units to the subarray (2, 4) and 4 units to the subarray (4, 4). The final arrangement of the servers is: [3, 4, 4, 9, 9]. The answer is 3 + 4 = 7. Function Description Complete the function findMinimumSum in the editor below. findMinimumSum has the following parameter(s): int power[n] : the computational powers of n different servers Returns long : the minimum possible sum of integers required to make the array non-decreasing Constraints 1 ≤ n ≤ 10 5 1 ≤ power[i] ≤ 10 9 Input Format