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

using namespace std;

long long int n, m;
vector<long long int> a;
vector<long long int> s;

main()
{
    scanf("%lld", &n);
    scanf("%lld", &m);

    for(long long int i = 0; i < n; i++)
    {
	long long int d;
	scanf("%lld", &d);
	a.push_back(d);
	s.push_back(0);
    }

    long long int dprev = 0;
    for(long long int i = 0; i < m; i++)
    {
	long long int d;
	long long int b;
	long long int suma = 0;

	scanf("%lld", &d);
	scanf("%lld", &b);
	long long int x = d - dprev;
	for(long long int j = 0; j < s.size(); j++)
	{
	    s[j] += x * a[j];
	    if(s[j] > b)
	    {
		suma += s[j] - b;
		s[j] = b;
	    }
	}
	
	dprev = d;
	printf("%lld\n", suma);
    }
}