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
#include <bits/stdc++.h>
using namespace std;
long long int tab[500005];  // prefix : "-"
unsigned long long int n=1,nn;
unsigned long long int ns=0;

unsigned long long int M[1000006];

unsigned long long int D[1000006];
long long int T[1000006];

unsigned long long int W[1000006];
unsigned long long int S[1000006];

unsigned long long int ins(int i,unsigned long long int d,unsigned long long int c,int s){
    unsigned long long int suma=0;

    int ri=i*2+1;
    int rs=s-1;

    if(T[i]!=-1){
        M[i]=T[i];

        M[ri]=T[i];
        D[ri]=0;
        S[ri]=(1<<rs)*T[i];
        S[ri-1]=S[ri];

        T[ri]=T[i];
        T[ri-1]=T[i];

      T[i]=-1;
    }
    D[i]+=d;

     if(s==0){
        M[i]-=D[i]*tab[i-n];

      //  cout<<M[i]<<"M[i] "<<D[i]<<"D[i] "<<tab[i-n]<<"tab[] "<<endl;

        suma=M[i]-c;
        M[i]=c;
        S[i]=c;
        D[i]=0;
        T[i]=-1;
        return suma;
    }

    unsigned long long int rM= M[ri] -tab[(ri<<rs)-n]*(D[i]+D[ri]);
    if(rM>c){
       // cout<<"R"<<i<<endl;
        suma=ins(ri  ,D[i],c,rs);
         unsigned long long int nS=(1<<rs)*c;
        suma+=S[ri-1]+(W[ri-1]*(D[ri-1]+D[i]))-nS;
       // cout<<S[ri-1]<<"S[ri-1] "<<W[ri-1]<<"W[ri-1] "<<D[ri-1]<<"D[ri-1] "<<nS<<"nS "<<endl;
         //cout<<i<<"i R->"<<suma<<"suma "<<endl;

        S[ri-1]=nS;
        T[ri-1]=c;
        D[ri-1]=0;
    }
    else{
      //  cout<<"L"<<i<<endl;;
        D[ri]+=D[i];
        suma=ins(ri-1,D[i],c,rs);
        S[ri]=S[ri]+W[ri]*D[ri];

        // cout<<i<<"i L<-"<<suma<<"suma "<<endl;

    }
    M[i]=c;
    D[i]=0;
    S[i]=S[ri]+S[ri-1];
    return suma;

}

void init(){
    for(int i=0;i<n+nn+1;i++)T[i]=-1;
    for(int i=0;i<nn;i++){W[i+n]=-tab[i];}
    for(int i=n-1;i>=1;i--){W[i]=W[i*2+1]+W[i*2];}
}

int main()
{
    ios::sync_with_stdio(0);
    int pp;
    cin>>nn>>pp;

    while(n<nn){n=n<<1;ns+=1;}

    for(int i=0;i<nn;i++){
        unsigned long long int a;cin>>a;
        tab[i]=-a;
    }
    sort(tab,tab+n);

    init();


    unsigned long long int prevdd=0;
    for(int i=0;i<pp;i++){
       unsigned long long int dd,cc;
       cin>>dd>>cc;

        if(M[1]-(dd-prevdd)*tab[0]    <=cc){cout<<"0"<<endl;prevdd=dd;continue;}
        unsigned long long int u=ins(1,dd-prevdd,cc,ns);
        prevdd=dd;
        cout<<u<<endl;;
      //  int z=1;int y=0;
       // while(z<=n){
           // for(int i=1;i<=z;i++){
              //  y++;
              //  cout<<y<<":[ "<<M[y]<<" "<<D[y]<<" "<<T[y]<<" ||| "<<S[y]<<" ]\t";
           // }
           // cout<<endl;
        //    z*=2;
       // }
       // cout<<u<<endl<<endl<<"___"<<endl;

    }


    return 0;
}
/*
7 10
11 9 7 6 5 3 1
2 7

7 10
10 5 3 7 4 8 1
2 9
3 6
5 21

*/