Given an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value by 1 in minimum changes possible.

Examples :

Input : a[] = {3, 1, 2, 1} Output : 1 Explanation : We can convert the array into 3 1 1 1 by changing 3rd element of array i.e. 2 into its previous integer 1 in one step hence only one step is required. Input : a[] = {3, 1, 5, 1} Output : 4 We need to decrease 5 to 1 to make array sorted in non-increasing order. Input : a[] = {1, 5, 5, 5} Output : 4 We need to increase 1 to 5.

**Brute-Force approach : ** We consider both possibilities for every element and find the minimum of two possibilities.

**Efficient Approach :** Calculate the sum of absolute differences between the final array elements and the current array elements. Thus, the answer will be the sum of the difference between the ith element and the smallest element occurred till then. For this, we can maintain a min-heap to find the smallest element encountered till now. In the min-priority queue, we will put the elements and new elements are compared with the previous minimum. If new minimum is found we will update it, this is done because each of the next element which is coming should be smaller than the current minimum element found till. Here, we calculate the difference so that we can get how much we have to change the current number so that it will be equal or less than previous numbers encountered till. Lastly, the sum of all these difference will be our answer as this will give the final value upto which we have to change the elements.

Below is **C++ **implementation of the above approach

`// CPP code to count the change required to ` `// convert the array into non-increasing array ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `DecreasingArray(` `int` `a[], ` `int` `n) ` `{ ` ` ` `int` `sum = 0, dif = 0; ` ` ` ` ` `// min heap ` ` ` `priority_queue<` `int` `, vector<` `int` `>, greater<` `int` `> > pq; ` ` ` ` ` `// Here in the loop we will ` ` ` `// check that whether the upcoming ` ` ` `// element of array is less than top ` ` ` `// of priority queue. If yes then we ` ` ` `// calculate the difference. After ` ` ` `// that we will remove that element ` ` ` `// and push the current element in ` ` ` `// queue. And the sum is incremented ` ` ` `// by the value of difference ` ` ` `for` `(` `int` `i = 0; i < n; i++) { ` ` ` `if` `(!pq.empty() && pq.top() < a[i]) { ` ` ` `dif = a[i] - pq.top(); ` ` ` `sum += dif; ` ` ` `pq.pop(); ` ` ` `pq.push(a[i]); ` ` ` `} ` ` ` `pq.push(a[i]); ` ` ` `} ` ` ` ` ` `return` `sum; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `a[] = { 3, 1, 2, 1 }; ` ` ` `int` `n = ` `sizeof` `(a) / ` `sizeof` `(a[0]); ` ` ` ` ` `cout << DecreasingArray(a, n); ` ` ` ` ` `return` `0; ` `} ` |

**Output:**

1

Time Complexity: **O(n log(n))**

Space Complexity: **O(n)**

Also see : Convert to strictly increasing array with minimum changes.

## Recommended Posts:

- Minimum number of changes required to make the given array an AP
- Sum of Areas of Rectangles possible for an array
- Sorting array with reverse around middle
- Making elements of two arrays same with minimum increment/decrement
- Water Connection Problem
- Array element moved by k using single moves
- Minimum sum of product of two arrays
- Minimum sum of absolute difference of pairs of two arrays
- Lexicographically smallest array after at-most K consecutive swaps
- Minimum sum of two numbers formed from digits of an array
- Job Sequencing Problem | Set 2 (Using Disjoint Set)
- Job Sequencing Problem | Set 1 (Greedy Algorithm)
- Connect n ropes with minimum cost
- Activity Selection Problem | Greedy Algo-1
- Coin Change | DP-7

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.