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
56
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

long long clients[200000];


int main(){

	long long clientsNo, cookNo;
	cin >> clientsNo >> cookNo;



	for(long long x=0; x<clientsNo; x++){
		cin >> clients[x];
	}


	sort(clients, clients+clientsNo);


	long long last = 0;
	for(long long x=0; x<clientsNo; x++){
		long long c = clients[x];
		clients[x] -= last;
		last = c;
	}

	for(long long t=0; t<cookNo; t++){
		long long cookTime;
		cin >> cookTime;


		long long timeSum = 0;
		long long delta = 0;


		for(long long x=0; x<clientsNo; x++){
			long long z = cookTime - clients[x] + delta;

			if(z > 0){
				delta = z;
				timeSum += z;
			} else {
				delta = 0;
			}
		}

		cout << timeSum << "\n";

	}

}