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
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n), grass(n, 0);
    for(int i = 0; i < n; ++i)
    {
        cin >> a[i];
    }
    int t = 0;
    int d, b;
    for(int i = 0; i < m; ++i)
    {
        cin >> d >> b;
        int dt = d -t;
        long long res = 0;
        for(int j = 0; j < n; ++j)
        {
            grass[j] += a[j]*dt;
            if(grass[j] > b)
            {
                res += grass[j] - b;
                grass[j] = b;
            }
        }
        t = d;
        cout << res << endl;
    }
}