1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> money) {
int answer = 0;
    int i = 1;
    while (true)
    {

        int v = 0;
        int idx = 0;
        if (i - 1 < money.size())
        {
            if (money.at(i - 1) > v)
            {
                v = money.at(i - 1);
                idx = i - 1;
            }
        }
        else
        {
            break;
        }
        if (i < money.size())
        {
            if (money.at(i) > v)
            {
                v = money.at(i);
                idx = i;
            }
        }
        if (i + 1 < money.size())
        {

            if (money.at(i + 1) > v)
            {
                v = money.at(i + 1);
                idx = i + 1;
            }
        }

        if (idx == i - 1)
        {
            answer += money.at(idx);
            i += 2;
        }
        else if (idx == i)
        {
            answer += money.at(idx);
            i += 3;
        }
        else if (idx == i + 1)
        {
            answer += money.at(i - 1);
            answer += money.at(idx);
            i += 4;

        }

    }

    return answer;
}