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

using namespace std;

typedef long long LL;
typedef vector<LL> VL;

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

	LL n, m, t;
	VL A;

	A.push_back(0);

	cin >> n >> m;

	while (n--)
	{
		cin >> t;
		A.push_back(t);
	}

	while (m--)
	{
		cin >> t;

		LL r = 0, time = 0;
		
		for (int i = 1; i < A.size(); i++)
		{
			if (time > 0) time = 0;
			time += A[i] - A[i - 1];

			if (time < t) {
				//brakuje czasu - dodaj ile brakuje
				r += t - time;
			}

			time -= t;

		}

		printf("%lld\n", r);
	}

	return 0;
}