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
/*
 *  Copyright (C) 2015  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <iostream>
#include <vector>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	vector<int> speeds;
	speeds.reserve(n);

	vector<long long int> heights(n);

	int speed;
	for (int i = 0; i < n; ++i) {
		cin >> speed;
		speeds.push_back(speed);
	}

	long long int last_day = 0;
	long long int day, cut;
	for (int i = 0; i < m; ++i) {
		cin >> day >> cut;

		long long int sum = 0;
		for (int j = 0; j < n; ++j) {
			heights[j] += speeds[j] * (day - last_day);

			auto delta = heights[j] - cut;
			if (delta > 0) {
				heights[j] = cut;
				sum += delta;
			}
		}

		last_day = day;
		cout << sum << endl;
	}

	return 0;
}