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
#include <iostream>
#include <stdlib.h>

using namespace std;

struct grass{
long long dh;
long long h;
long long d;
};

grass field[500000];

int compare (const void * a, const void * b)
{
  return ( ((grass*)a)->dh - ((grass*)b)->dh )>0?1:-1;
}

int main()
{
    unsigned long long n,m,a,d,d_old,b,sia=0;
    long i, j;

    cin.sync_with_stdio(false);
    cin>>n>>m;

    for( i=0; i<n; i++)
    {
        cin>>field[i].dh;
        field[i].d = 0;
        field[i].h = 0;
    }

    qsort (field, n, sizeof(grass), compare);


    for( i=0,d_old=0; i<m; i++, sia=0)
    {
        cin>>d>>b;

        for(j=n-1; j>=0; j--)
        {
            if(field[j].h+(d-field[j].d)*field[j].dh<=b)
            {
                cout<<sia<<endl;
                break;
            }
            else
            {
                field[j].h+=(d-field[j].d)*field[j].dh;
                sia+=field[j].h-b;
                field[j].h-=field[j].h-b;
                field[j].d = d;

            }
        }

        if(j == -1)
            cout<<sia<<endl;
    }

    return 0;
}