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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	vector<int> D(m), T(n);
	for (int i = 0; i < n; ++i)
		cin >> T[i];

	for(int i = 0; i < m; ++i)
		cin >> D[i];

	for(int i = 0; i < m; ++i) {
		int finish_at = 0;
		int r = 0;
		int d = D[i];
		for (int j = 0; j < n; ++j) {
			int t = T[j];
			if (finish_at + d <= t) {
				finish_at = t;
			} else {
				finish_at += d;
				r += (finish_at - t);
			}
		}
		cout << r << endl;
	}

	return 0;
}