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 <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll A[500100];
ll B[500100];
int main()
{
	int n, m;
	scanf("%d%d", &n, &m);
	ll d, b;
	ll ld = 0;
	ll suma = 0;
	for(int i = 0; i < n; ++i)
		scanf("%lld", &A[i]);
	for(int i = 0; i < m; ++i)
	{
		scanf("%lld%lld", &d, &b);
		suma = 0;
		for(int j = 0; j < n; ++j)
		{
			
			B[j] += A[j]*(d-ld);
			if(B[j] > b)
			{
				suma += B[j] - b;
				B[j] = b;
			}
		}
		printf("%lld\n", suma);
		ld = d;
	}

	return 0;
}