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
#include <iostream>
#include <map>

using namespace std;

int main() {
    int n, m;
    cin >> n;
    cin >> m;

    long long *klienci = new long long[n];
    long long *czekanie = new long long[n];
    long long *piece = new long long[m];
    map<long long, long long> pieceCache;

    for (int i = 0; i < n; i++) {
        cin >> klienci[i];
    }

    for (int i = 0; i < m; i++) {
        cin >> piece[i];
    }

    for (int i = 0; i < m; i++) {
        if (pieceCache.find(piece[i]) == pieceCache.end()) {
            czekanie[0] = piece[i] - klienci[0] > 0 ? piece[i] - klienci[0] : 0;
            long long suma = czekanie[0];
            for (int j = 1; j < n; j++) {
                if (klienci[j - 1] + czekanie[j - 1] + piece[i] <= klienci[j]) {
                    czekanie[j] = 0;
                } else {
                    czekanie[j] = klienci[j - 1] + czekanie[j - 1] + piece[i] - klienci[j];
                }
                suma += czekanie[j];
            }
            cout << suma << endl;
            pieceCache[piece[i]] = suma;
        } else {
            cout << pieceCache[piece[i]] << endl;
        }
    }

    return 0;
}