Submission #5,290

2023-04-25 15:21:37

cpp11

Accepted 35/35

27ms

5708 KiB

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int szamok[n];
    for (int i = 0; i < n; i++) {
        cin >> szamok[i];
    }
    int osszeg [n];
    osszeg [0] = szamok[0];
    osszeg[1] = szamok[1] + osszeg[0];
    for (int i = 2; i < n; i++){
        osszeg[i] = min(osszeg[i-1], osszeg[i-2]) + szamok[i];
    }
    cout << osszeg[n-1] << endl;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	3ms	1872 KiB
		2	Accepted	0/0	27ms	3616 KiB
		3	Accepted	1/1	3ms	2280 KiB
		4	Accepted	1/1	3ms	2488 KiB
		5	Accepted	1/1	3ms	2708 KiB
		6	Accepted	1/1	3ms	2840 KiB
		7	Accepted	1/1	3ms	3044 KiB
		8	Accepted	2/2	3ms	3104 KiB
		9	Accepted	2/2	3ms	3356 KiB
		10	Accepted	2/2	3ms	3600 KiB
		11	Accepted	2/2	4ms	3688 KiB
		12	Accepted	2/2	4ms	3760 KiB
		13	Accepted	2/2	4ms	3948 KiB
		14	Accepted	2/2	7ms	4016 KiB
		15	Accepted	2/2	9ms	4004 KiB
		16	Accepted	2/2	14ms	4300 KiB
		17	Accepted	2/2	19ms	4828 KiB
		18	Accepted	2/2	21ms	4876 KiB
		19	Accepted	2/2	24ms	5328 KiB
		20	Accepted	2/2	24ms	5556 KiB
		21	Accepted	2/2	27ms	5700 KiB
		22	Accepted	2/2	27ms	5708 KiB