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

using namespace std;

int main() {
    long n, m;

    scanf("%ld %ld\n", &n, &m);
    vector<long long> clients(n);
    for (long i = 0l; i < n; i++) {
	scanf("%lld", &clients[i]);
    }

    vector<long long> ovens(m);
    for (long i = 0l; i < m; i++) {
	scanf("%lld", &ovens[i]);
    }

    for (long i = 0l; i < m; i++) {
	long long curr_time = 0ll;
	long long wait_sum = 0ll;
	long long oven_time = ovens[i];
	for (long j = 0l; j < n; j++) {
	    long long client = clients[j];
	    long long finish_time = max(curr_time + oven_time, client);
	    wait_sum += finish_time - client;
	    curr_time = finish_time;
	}
	printf("%lld\n", wait_sum);
    }

    return 0;
}