Submission

[-SSSSSSSSS]

Score: 0

User: detectives_conan

Problemset: stock

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-26 21:09:58

/*
    Author : detective conan
    Problem : stock
    Created : 26/03/2025 15:26 UTC+7
*/
#include <bits/stdc++.h>
#define int long long 
#define FOR(i, s, t) for(int i = s; i <= t; ++i)
#define rep(i, s, t) for(int i = s; i >= t; --i)
#define HAVE_TESTCASE false
#define mod (int)(1e9 + 7)
#define pii pair<int, int>
#define tiii tuple<int, int, int>
#define vec vector
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define conan cin.tie(nullptr)->sync_with_stdio(false)
#define ANS(n, s) cout << n << s

using namespace std;
using u32 = unsigned;
using i64 = int64_t;
using u64 = unsigned i64;

const int MAX_N = 1e5 + 10;
int n, a[MAX_N], cnt;

void solve(){
    cin >> n;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) cnt += max(0ll, a[i] - a[i - 1]);
    cout << cnt << '\n';
}

int32_t main() {
    conan;
    int t = 1;
    if (HAVE_TESTCASE) cin >> t;
    while (t--) solve();
}