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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
/*
 * Sia.cpp
 *
 *  Created on: 28 wrz 2015
 *      Author: Marcin Skibinski
 */

#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>
#include <iterator>

struct cutting
{
    long long day;
    long long height;
    int position;
};

//--------------------------------------------------------------------------------------------------

class Siano
{
public:
    Siano(int s) : size(s), day(0), height(0)
    {
        field.resize(size);
        growthOfAllNext.resize(size+1);
        cuttings.push({0, 0, 0});
    }

    void readData();
    void processData();
    long long cut(long long day, long long height);

private:
    int size;
    std::vector<int> field;
    std::vector<long long> growthOfAllNext;
    std::stack<cutting> cuttings;
    long long day;
    long long height;

    long long newHeight(cutting &c);
    long long makeCut(cutting &c, int newPosition, int lastPosition);

    void printVariables();

    struct Comp
    {
        Comp(const cutting & c, const Siano * siano) : cut(c), siano_(siano) { }

        bool operator() (int a, long long b)
        {
            return (siano_->day - cut.day) * a + cut.height < b;
        }

    private:
        const cutting & cut;
        const Siano * siano_;
    };
};

void Siano::readData()
{
    for (int i=0; i<size; ++i)
    {
        std::scanf("%d", &field[i]);
    }
}

void Siano::processData()
{
    std::sort(field.begin(), field.end());

    growthOfAllNext[size] = 0;
    for (int i=size-1; i>=0; --i)
    {
        growthOfAllNext[i] = field[i] + growthOfAllNext[i+1];
    }
}

long long Siano::cut(long long day, long long height)
{
    this->day = day;
    this->height = height;

    long long sum = 0;

    int lastPosition = size;
    while (true)
    {
        if (cuttings.empty())
        {
            cuttings.push({day, height, lastPosition});
            break;
        }
        auto c = cuttings.top();
        auto newH = newHeight(c);

        if (newH >= height)
        {
            sum += makeCut(c, c.position, lastPosition);
            lastPosition = c.position;
            cuttings.pop();
        }
        else
        {
            std::vector<int>::iterator position = std::lower_bound(field.begin()+c.position, field.begin()+lastPosition, height, Comp(c, this));
            if (position == field.end())
            {
                break;
            }
            auto newPosition = std::distance(field.begin(), position);
            sum += makeCut(c, newPosition, lastPosition);
            cuttings.push({day, height, newPosition});
            break;
        }
    }
    return sum;
}

long long Siano::newHeight(cutting &c)
{
    return field[c.position] * (day - c.day) + c.height;
}

long long Siano::makeCut(cutting &c, int newPosition, int lastPosition)
{
    return (growthOfAllNext[newPosition] - growthOfAllNext[lastPosition]) * (day - c.day)
            + (c.height - height) * (lastPosition - newPosition);
}

//--------------------------------------------------------------------------------------------------

int main()
{
    int n, m;
    long long d, b;

    std::scanf("%d %d", &n, &m);

    Siano siano(n);

    siano.readData();
    siano.processData();

    for (int i=0; i<m; ++i)
    {
        std::scanf("%lld %lld", &d, &b);
        std::printf("%lld\n", siano.cut(d, b));
    }

    return 0;
}