Lumimyrsky

#include <iostream>

using namespace std;

int main()
{
    // code to compile: g++ -std=c++11 A.cpp -o A && ./A < A.in
    int n = 10;     // number of elements on both path
    int a[n], b[n]; // path a and b
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
    }

    int max_a = 0; // max ascent on path a
    int max_b = 0; // max ascent on path b
    for (int i = 1; i < n; i++)
    {
        if (a[i - 1] < a[i])
        {
            max_a += a[i] - a[i - 1];
        }
        if (b[i - 1] < b[i])
        {
            max_b += b[i] - b[i - 1];
        }
    }

    if (max_a > max_b)
    {
        cout << "2" << endl;
    }
    else
    {
        cout << "1" << 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