1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <vector>
#include <queue>
#include <iostream>

using namespace std;

int main() {

  cin.tie(0);

  int n, m, suma = 0;

  vector<pair<long long, long long> > t;

  cin >> n >> m;

  t.push_back(make_pair(0, 0));

  for (int i = 0; i < n; i++) {
    int pomocnicza;
    cin >> pomocnicza;
    t.push_back(make_pair(pomocnicza, 0));
  }

  for (int j = 0; j < m; j++) {
    int d;
    cin >> d;

    for (int i = 1; i < n+1; i++) {

      if (t[i].first >= t[i-1].second + d) {
        t[i].second = t[i].first;
      } else {
        t[i].second = t[i-1].second + d;
        suma += t[i].second - t[i].first;
      }

    }

    cout << suma << "\n";
    suma = 0;

  }
}