Submission

Score: 100

User: Kei

Problemset: ประมูลการกุศล

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-08 14:52:36

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;

void solve(){
    int tmax=0;
    int n,cur;
    ll sum=0;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> cur;
        if(cur>tmax){
            sum+=(ll)cur;
            tmax=cur;
        }
    }
    cout << sum;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}