In python

Problem Statement We have an array Arr of Ninteger elements You want to sort it in a non-deskandinsardar using the following operation any number (possible zero on line Take a subsequence of elements from The array and decrease each element of it by * 0). You want to know the minimum possible sum of X, if we choose the applied operations optimally. Since the answer can be very large return it modulo 10^9+7 saketsa Note: A subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing the order of the remaining elements. A non-descending array is an array where for each (0