Lumimyrsky

#include <bits/stdc++.h>
 
using namespace std;
typedef long long LL;
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
 
  LL one = 0;
  LL x0, x1;
  cin >> x0;
  for (int i = 1; i < 10; i++) {
    cin >> x1;
    one += max(x1 - x0, 0LL);
    x0 = x1;
  }
 
  LL two = 0;
  cin >> x0;
  for (int i = 1; i < 10; i++) {
    cin >> x1;
    two += max(x1 - x0, 0LL);
    x0 = x1;
  }
 
  if (one < two) {
    cout << "1\n";
  } else {
    cout << "2\n";
  }
  return 0;
}
 
/*
A blizzard has surprised the residents of Syrjälä.
You are skiing to school. However, there are two separate routes to school, and
you want to choose the route with the least ascent. Going from height x to a
higher point y means an ascent of y-x units.
Your home and school are at height 0. You are given heights at various points
along each route and you have to choose the better one.
Input
The input consists of two lines.
The first line contains 10 integers describing heights at various points on
the first route.
The second line contains 10 integers describing heights at various points on
the second route.
Each height is between 0\dots100.
Output
Print 1 if the first route has less ascent, or 2 if the second route has
less ascent.
You can assume that the total ascent of the routes differ.
Example
Input:
0 0 3 3 1 2 2 2 1 0
0 1 2 3 2 2 3 0 1 1
 
Output:
1
 
Explanation: The heights along the routes are illustrated in the figure below.
 
The first route has 4 units of ascent while the second route
has 5 units of ascent. Thus the better choice is route 1.
Grading
You will get 100 points from the task if your code produces the correct
answer to each test.*/

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