cses day1 problems solutions

increasing_array.cpp

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

void solution(){
    ll n;
    cin >> n;
    ll arr[n];
    for(ll i=0; i<n; i++){
        cin >> arr[i];
    }
    ll turns = 0;
    for(ll i=0; i<n-1; i++){
        if(arr[i]>arr[i+1]){
            turns=turns+(arr[i]-arr[i+1]);
            arr[i+1]=arr[i];
        }
    }
    cout << turns << endl;

}

int main() {
    int T=1;
    // cin >> T;
    for(int t=0; t<T; t++) {
        solution();
    }
    return 0;
}