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
#include <iostream>
using namespace std;

int main() {
	long long c[200000];
	int n, m;
	cin >> n >> m;

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

	for(int i = 0; i < m; i++) {
		long long accumulator = 0, time = 0, o;
		cin >> o;

		for(int j = 0; j < n; j++) {
			long long client = c[j] - o;
			if(client < time) {
				accumulator += time - client;
				time += o;
			}
			else {
				time = client + o;
			}
		}

		cout << accumulator;
		if(i < m-1) cout << endl;
	}

	return 0;
}