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

using namespace std;

int main() {
	long n, m;
	
	cin >> n >> m;

	vector<long long> t(n);

	for (long i = 0; i < n; ++i) {
		cin >> t[i];
	}

	for (long i = 0; i < m; ++i) {
		long d;

		cin >> d;

		long long totalWaitingTime=0;
		long long earliestAccessibility = 0;

		for (long i = 0; i < n; ++i) {
			earliestAccessibility += d;
			if (earliestAccessibility <= t[i]) {
				earliestAccessibility = t[i];
			}
			else {
				totalWaitingTime += earliestAccessibility - t[i];
			}
		}

		cout << totalWaitingTime << endl;
	}

	return 0;
}