Given an array **arr[]** of **N** integers, the task is to delete the element from the given array if element to it’s left is smaller than it. Keep on deleting the elements from the array until no element has a smaller adjacent left element. Print the resultant array after above operation.

**Examples:**

Input:arr[] = {2, 4, 1, 3, 4}

Output:2 1

Explanation:

Since 4 is greater than 2 remove 4, and arr become {2, 1, 3, 4}.

Now 3 is greater than 1 so remove 3 and arr become {2, 1, 4}.

Now 4 is greater than 1 so remove 4 and arr become {2, 1}.

Now no elements satisfy the removing criteria so the resultant array is {2, 1}.

Input:arr[] = {5, 4, 3, 2, 1}

Output:5 4 3 2 1

**Approach:** The idea is to use the concept of Merge Sort.

- Divide the input array into sub-arrays till the size of each sub-array becomes 1.
- Start merging the element.
- While merging, delete elements from the left subarray till it’s rightmost element, which have a value greater than the leftmost element of the right subarray.
- Repeat the above steps in each merging step such all elements with value smaller to it’s left have been deleted.
- Finally print the resultant array.

Below is the implementation of the above approach:

`# Python program for the above approach ` ` ` `# Function to delete all elements which ` `# satisfy the condition A[i] > A[i-1] ` `def` `mergeDel(l): ` ` ` ` ` `# Divide array into its subarray ` ` ` `if` `len` `(l) ` `=` `=` `1` `: ` ` ` ` ` `return` `l ` ` ` ` ` `m ` `=` `int` `( ` `len` `(l) ` `/` `2` `) ` ` ` ` ` `# Getting back merged array with all ` ` ` `# its right element greater than left one. ` ` ` `return` `merge(mergeDel(l[ ` `0` `: m ]), ` ` ` `mergeDel(l[ m : ` `len` `(l)]) ) ` ` ` ` ` `# Function to implement merging of arr[] ` `def` `merge(x, y): ` ` ` ` ` `for` `i ` `in` `y: ` ` ` ` ` `if` `x[` `-` `1` `] > i : ` ` ` ` ` `x ` `=` `x ` `+` `[i] ` ` ` ` ` `return` `x ` ` ` `# Function defination for main() ` `def` `main(): ` ` ` `# Given array arr[] ` ` ` `arr ` `=` `[` `5` `, ` `4` `, ` `3` `, ` `2` `, ` `1` `] ` ` ` `print` `(mergeDel(arr)) ` ` ` `# Driver Code ` `main() ` |

*chevron_right*

*filter_none*

**Output:**

[5, 4, 3, 2, 1]

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

**Auxiliary Space:** *O(1)*

## Recommended Posts:

- Count of Array elements greater than all elements on its left and next K elements on its right
- Count of Array elements greater than all elements on its left and at least K elements on its right
- Count of array elements which are greater than all elements on its left
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Count of Array elements greater than or equal to twice the Median of K trailing Array elements
- Merge first two minimum elements of the array until all the elements are greater than K
- Find all elements in array which have at-least two greater elements
- Change in Median of given array after deleting given elements
- Maximum possible middle element of the array after deleting exactly k elements
- Minimum elements to change so that for an index i all elements on the left are -ve and all elements on the right are +ve
- Find maximum points which can be obtained by deleting elements from array
- Minimum steps required to reduce all the elements of the array to zero
- Length of longest subarray in which elements greater than K are more than elements not greater than K
- Minimum Decrements on Subarrays required to reduce all Array elements to zero
- Rearrange array such that even index elements are smaller and odd index elements are greater
- Sum of all array elements less than X and greater than Y for Q queries
- Smallest greater elements in whole array
- Find minimum value to assign all array elements so that array product becomes greater
- Generate original array from an array that store the counts of greater elements on right
- Count elements in first Array with absolute difference greater than K with an element in second Array

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.