Lumimyrsky

#include <iostream>
#include <vector>
#include <math.h>
#include <limits.h>
#include <set>
#include <algorithm>
#include <queue>
#include <bitset>
#include <limits.h>
#include <float.h>
#include <stack>
#include <map>
 
using namespace std;
using ll = long long;
 
int main()
{
    vector<int> h1;
    vector<int> h2;
    int val;
    for(int i = 0; i < 10; i++) {
        cin >> val;
        h1.push_back(val);
    }
    for(int i = 0; i < 10; i++) {
        cin >> val;
        h2.push_back(val);
    }
    int a1 = 0;
    int a2 = 0;
    for(int i = 1; i < 10; i++) {
        a1 += max(h1[i]-h1[i-1], 0);
    }
     for(int i = 1; i < 10; i++) {
        a2 += max(h2[i]-h2[i-1], 0);
    }

    //cout << a1 << " " << a2 << "\n";

    if(a1 < a2)
        cout << 1;
    else
        cout << 2;
}

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