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>

#define MAX_MN 200000

int main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie();

	int n, m;

	std::cin >> n >> m;

	long long *customers = new long long[n];
	long long *results = new long long[m];

	long long prev = 0;
	for (int i = 0; i < n; i++)
	{
		int temp;
		std::cin >> temp;
		customers[i] = temp - prev;
		prev = temp;
	}

	for (int i = 0; i < m; i++)
	{
		long long oven;
		std::cin >> oven;

		int result = 0;
		for (int j = 0; j < n; j++)
		{
			if (customers[j] < oven)
			{
				result += oven - customers[j];
			}
		}

		results[i] = result;
	}

	for (int i = 0; i < m; i++)
	{
		std::cout << results[i] << '\n';
	}

	return 0;
}