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 <stdio.h>
#include <stdlib.h>

int main() {

        int n,m,i,j;
        long long *a,*b, d,h,pd,s, dd;

        scanf("%d%d", &n, &m);
        a = malloc(n*sizeof(*a));
        b = malloc(n*sizeof(*b));

        for (i=0; i<n; ++i) {
                scanf("%lld", a+i);
                b[i] = 0;
        }

        pd = 0;
        for (i=0; i<m; ++i) {
                scanf("%lld%lld", &d, &h);
                s = 0;
                dd = d-pd;
                for (j=0; j<n; ++j) {
                        b[j] += dd*a[j];
                        if (b[j] > h) { s += b[j]-h; b[j] = h; }
                }
                printf("%lld\n", s);
                pd = d;
        }

        free(a);
        free(b);

        return 0;
}