Submission

Score: 100

User: ChanakanStudy

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-09 19:08:51

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n,sum=0,winnernow = -1;
    cin >> n;
    while(n--) {
        int temp;
        cin >> temp;
        if(temp > winnernow) {
            winnernow = temp;
            sum += temp;
        }
    }
    cout << sum;
    return 0;
}