Submission
Status:
[PP-SSSSSSS]
Score: 0
User: Dormon
Problemset: stock
Language: cpp
Time: 0.002 second
Submitted On: 2025-03-26 12:21:15
#include <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
long long ans = 0ll;
cin >> n;
vector<int> v(n + 1); v[0] = 1e9;
for (int i = 1;i <= n;i++){
cin >> v[i];
ans += max(0, v[i] - v[i - 1]) + 0ll;
}
cout << ans << '\n';
}