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
61
62
63
64
65
66
67
68
69
#include <iostream>
#include <vector> 
#include <algorithm>
using namespace std; 

typedef long long int LL; 
#define MP make_pair 
#define PB push_back 
#define ST firt
#define ND second
#define DBG(n) cerr<< #n << " " << n <<'\n'

int main()
{
    int n, m;
    std::cin >> n >> m;
    LL result = 0;

    for (unsigned int i = 0; i < m; i++)
    {
        int val;
        cin >> val;
        result += val;
    }
    LL remainder = 0;
    LL bi, di;

    int first = 0;
    LL r = 0;
    for (unsigned int i = 1; i <= m; ++i)
    {
        std::cin >> di >> bi;
        if (i == 1)
        {
            remainder = (result * (di - first)) - (bi * n);
            if (remainder < 0)
            {
                r = (result * (di - first));
            }
            else
            {
                first = di;
                r = bi * n;
            }
        }
        else {
            remainder = ((result * (di - first)) + r) - (bi * n);
            if (remainder < 0)
            {
                r = (result * (di - first));
            }
            else {
                first = di;
                r = bi * n;
            }

        }

        if (remainder < 0)
        {
            cout << "0" << '\n';
        }
        else
        {
            cout << remainder << '\n';
        }
    }
    return 0;
}