Lumimyrsky

#include <iostream>

using namespace std;


int TotalAscent(int route[], int size) {
    int totalAscent = 0;
    int currentHeight = 0;

    for (int i = 0; i < size; ++i) {
        int ascent = max(0, route[i] - currentHeight);
        totalAscent += ascent;
        currentHeight = route[i];
    }

    return totalAscent;
}

int main() {

    int route1[10];
    int route2[10];

    for (int i = 0; i < 10; ++i) {
        cin >> route1[i];
    }

    for (int i = 0; i < 10; ++i) {
        cin >> route2[i];
    }


    int Route1 = TotalAscent(route1, 10);
    int Route2 = TotalAscent(route2, 10);


    if (Route1 < Route2) {
        cout << 1 << endl;
    }
    else {
        cout << 2 << endl;
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED