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
51
52
53
54
55
#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	vector <int> Customers;
	vector <int> Bake_Time;
	
	for (int i=0; i<n; i++)
	{
		int a;
		cin >> a;
		Customers.push_back(a);
	}
	
	for (int i=0; i<m; i++)
	{
		int a;
		cin >> a;
		Bake_Time.push_back(a);
	}
	
	sort (Customers.begin(), Customers.end());
	
	for (int i=0; i<m; i++)
	{
		long long Amount = 0;
		long long Index = 0;
		
		for (int j=0; j<n; j++)
		{
			int Difference = Index + Bake_Time[i] - Customers[j];
			
			if (Difference > 0)
			{
				Amount += Difference;
				Index += Bake_Time[i];
			}
			else
			{
				Index = Customers[j];
			}
		}
		
		cout << Amount << endl;
	}
}