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
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define sz(x) int((x).size())
#define dbg(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i)
#define fi first
#define se second
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;

int n,m;
int a[500100];
ll aSums[500100];
int partsSize;
vector<int> parts;
vector<ll> partsB;
vector<ll> partsD;

int findPart(ll d, ll b) {
    int res = 0;
    for (int mid = partsSize-2; mid >=0; mid--) {
        if (mid < partsSize-1) {
            ll val2 = a[parts[mid+1]-1]*(d - partsD[mid]) + partsB[mid];
            if (b >= val2) {
                res = mid+1;
                break;
            }
        }
    }
    return res;
}

int findItem(ll dt, ll b, int p, int q, ll eps) {
    if (p == q)
        return p;
    int mid = (p+q)/2;
    ll val = a[mid]*dt + eps;
    if (b <= val)
        return findItem(dt, b, p, mid, eps);
    else
        return findItem(dt, b, mid+1, q, eps);
}

int fir(int part) {
    return parts[part];
}

int sec(int part) {
    if (part == partsSize-1)
        return n-1;
    else
        return parts[part+1]-1;
}

ll rangeASum(int p, int q) {
    if (p>0)
        return aSums[q] - aSums[p-1];
    else
        return aSums[q];
}

int main() {
    scanf("%d %d", &n, &m);
    FOR(i, n) {
        scanf("%d", &a[i]);
        //cin >> a[i];
    }
    sort(a, a+n);
    FOR(i, n) {
        if (i>0)
            aSums[i] = aSums[i-1] + a[i];
        else
            aSums[0] = a[0];
    }

    partsSize = 1;
    parts.pb(0);
    partsB.pb(0);
    partsD.pb(0);
    int lastD = 0;

    FOR(i, m) {
        ll d,b;
        //cin >> d >> b;
        scanf("%lld %lld", &d, &b);

        if (b>a[n-1]*(d-partsD[partsSize-1]) + partsB[partsSize-1]) {
            cout << 0 << endl;
            continue;
        }
        int part = findPart(d, b);//lin search

        int p = parts[part];
        int q;
        if (part == parts.size()-1)
            q = n-1;
        else
            q = parts[part+1]-1;
        ll dt = d - partsD[part];
        int item = findItem(dt, b, p, q, partsB[part]); //bin search inside


        ll res = 0;
        for (int j = partsSize-1; j>part;--j) {
            res += rangeASum(fir(j),sec(j))*(d - partsD[j]) - (b-partsB[j])*(sec(j)-fir(j)+1);
            parts.pop_back();
            partsB.pop_back();
            partsD.pop_back();
        }
        res += rangeASum(item,sec(part))*dt - (b-partsB[part])*(sec(part)-item+1);
        partsSize = part+1;

        if (item == fir(part)) {
            partsB[part] = b;
            partsD[part] = d;
        } else {
            parts.pb(item);
            partsB.pb(b);
            partsD.pb(d);
            partsSize++;
        }

        //cout << res << endl;
        printf("%lld\n", res);
        /*
        dbg(partsSize);
        FOR(i,partsSize) {
            dbg(parts[i]);
            dbg(partsB[i]);
            dbg(partsD[i]);
        }*/
        lastD = d;
    }
    return 0;
}