Submission

Score: 100

User: angpangSK

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-09-24 19:24:22

#include <iostream>
using namespace std;

int main() {
  int n;
  cin >> n;
  int p[n];
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  int sum_max = 0;
  int max = p[0];
  sum_max += max;
  for (int i = 1; i < n; i++) {
    if (p[i] > max) {
      max = p[i];
      sum_max += max;
    }
  }
  cout << sum_max;
  return 0;
}