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
45
46
47
48
49
#include <iostream>
#include <vector>

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);

	int n;
	cin >> n;

	int m;
	cin >> m;

	vector<long long> klient(200001); // verify is long ok?
	vector<long> piek(200001);

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

	for (int i = 0; i < m; i++) {
		long x;
		cin >> x;
		piek[i] = x;
		
	}
	
	for (int i = 0; i < m; i++) { // loop over piekarniks
		long long wait = 0;
		long long water = 0;
		long p = piek[i];
		for (int j = 0; j < n; j++) { // loop over klients
			if (klient[j] >= water + p) {
				water = klient[j];
				// no wait
			} else {
				water = water + p;
				wait += water - klient[j];
			}
		}
		cout << wait << endl;
	}

	return 0;
}