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

using namespace std;

int main()
{
    long long n, m, b, d;
    long long *a, *A, *res;
    scanf("%lld %lld", &n, &m);
    a = new long long[n];
    A = new long long[n];
    for (long long i = 0; i < n; i++) {
        scanf("%lld", &A[i]);
    }
    long long *aj;
    long long lastD = 0;
    for (long long i = 0; i < m; i++) {
        scanf("%lld %lld", &d, &b);
        long long result = 0LL;
        for (long long j = 0; j < n; j++) {
            aj = a + j;
            *aj += (d - lastD) * A[j];
            if (*aj >= b) {
                result += *aj - b;
                *aj = b;
            }
        }
        lastD = d;
        cout << result << endl;
    }

    return 0;
}