Envío 5919

Código

#include <bits/stdc++.h>

using namespace std;

int arr[100];
int arr2[100];
int n;

int solve(int i, int h){
    if(i >= n){
        return 0;
    }
    else if(h > 0 && h <= arr[i]){
        return h+solve(i+1, h);
    }else if (h == 0){
        int ans = solve(i+1, 0);
        for(int j = 0; j < n; j++){
            if(arr2[j] > arr[i])
                break;
            ans = max(ans, arr2[j]+solve(i+1, arr2[j]));
        }
        return ans;
    }
    return 0;
}

int main(){
    cin >> n;
    for( int i = 0; i < n ; i++){
        cin >> arr[i];
        arr2[i] = arr[i];
    }
    sort(arr2, arr2+n);
    cout << solve(0,0);
}