Submission

Score: 100

User: 38408

Problemset: ซื้อขายหุ้นซีเค

Language: cpp

Time: 0.026 second

Submitted On: 2026-10-15 22:50:56

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> num(n);

    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }

    long long maxx = 0;

    for (int i = 1; i < n; i++) {
        if (num[i] > num[i - 1]) {
            maxx += num[i]-num[i-1];
        }
    }

    cout << maxx;
    return 0;
}