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
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <vector>
using namespace std;

vector<long long> V;
vector<int> O;
int n, m;

void GrowUp(long long d)
{
    for(int i = 0; i < n; i++)
        V[i] += O[i] * d;
}

long long Cut(long long b)
{
    int x = 0;
    long long sum = 0;
    for(int i = 0; i < n; i++)
    {
        if(V[i] > b)
        {
            x = V[i] - b;
            sum += x;
            V[i] = V[i] - x;
        }
    }
    return sum;
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    for(int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        V.push_back(0);
        O.push_back(a);
    }

    long long d, b, prevD;
    vector<int> test;
    test.push_back(0);

    for(int i = 1; i <= m; i++)
    {
        cin >> d >> b;
        test.push_back(d);
        prevD = d - test[i - 1];

        GrowUp(prevD);
        cout << Cut(b) << endl;
    }
    return 0;
}