#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//Vishal Kumar Singh
//AVS
int main(){
ll n,sum=0;
cin>>n;
ll a[n];
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
for (int i = 1; i < n; i++)
{
if (a[i-1]>a[i])
{
sum+=(a[i-1]-a[i]);
}
}
cout<<sum;
}
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |