Problem:
Score : 300 points

Problem Statement

N persons are standing in a row. The height of the i-th person from the front is A_i.

We want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:

Condition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.

Find the minimum total height of the stools needed to meet this goal.

Constraints

1 \leq N \leq 2\times 10^5

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 \ldots A_N

Output

Print the minimum total height of the stools needed to meet the goal.

Sample Input 1

5
2 1 5 4 3

Sample Output 1

4

If the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.

We cannot meet the goal with a smaller total height of the stools.

Sample Input 2

5
3 3 3 3 3

Sample Output 2

0

Giving a stool of height 0 to everyone will work.

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
                                    using namespace std;
                                    #define pb push_back
                                    #define endl '\n'
                                    #define mod 1000000007
                                    #define forn(i, n) for (int i = 0; i < (int)(n); i++)
                                    #define REPa(i,b) for(int i=1;i<=b;i++)
                                    #define REP(i,n) for(int i=0;i<n;i++)
                                    #define init(arr,value) memset(arr,value,sizeof(arr))
                                    #define test unsigned int tet;cin >> tet;while(tet--)
                                    #define sz(a) int((a).size())
                                    #define vi vector<int>
                                    typedef long long ll;
                                    typedef unsigned long long ull;
                                    typedef long double ld;
                                    typedef pair<int, int> pii;
                                    typedef pair<ll, ll> pll;
                                    #define sf scanf
                                    #define pf printf
                                    #define all(x) (x).begin(), (x).end()
                                    #define SUM(v) accumulate(all(v),ll(0))
                                    #define present(container, element) (container.find(element) != container.end())
                                    #define cpresent(container, element) (find(all(container),element) != container.end())
                                    int max(int a,float b){
                                        if(a>b)
                                          return a;
                                          return b;
                                    }
                                    ll gcd(ll a,ll b){
                                      if(a%b==0) return b;
                                      else
                                          return gcd(b,a%b);
                                      }
                                    ll lcm(ll a,ll b){
                                      return a*b/gcd(max(a,b),min(a,b));
                                      }
                                    bool sort_pair(pair<int,int>a,pair<int,int> b){
                                      return a.first<b.first;
                                     }
                                    bool sort_pair_(pair<int,int>a,pair<int,int>b){
                                      return a.second>b.second;
                            }
                                bool isprime(ll x){
                                    for(ll i=2;i*i<=(x);i++){
                                    if(x%i==0)
                                    return 0;
                                    }
                                        return 1;
                                    }
                                    int main(){
                                        string s;
                                        cin>>s;
                                        int n=sz(s);
                                        int sum=0;
                                        for(int i=0;i<n;i++){
                                            sum+=(s[i]-'0')%9;
                                        }
                                        
                                        if(sum%9==0)pf("Yes");
                                        else pf("No");
                                        
                                        
                                        
                                    }