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 <cstdio>
#include <map>

typedef long long ULL;

struct Field {
	ULL h;
	int c;
};

typedef std::map<int, Field>::iterator it_type;

std::map<int, Field> fields;

ULL MAX(ULL a, ULL b) {
	if (a > b)
		return a;
	return b;
}

ULL MIN(ULL a, ULL b) {
	if (a < b)
		return a;
	return b;
}

int main() {
	int n, m;
	scanf("%d %d", &n, &m);

	while (n--) {
		int a;
		scanf("%d", &a);
		if (fields.find(a) == fields.end()) {
			Field f;
			f.h = 0;
			f.c = 1;
			fields[a] = f;
		}
		else {
			fields[a].c++;
		}
	}

	ULL lastd = 0;
	while (m--) {
		ULL d, b;
		scanf("%lld %lld", &d, &b);
		ULL sum = 0;
		ULL t = d - lastd;
		lastd = d;
		
		for (it_type iterator = fields.begin(); iterator != fields.end(); iterator++) {
			iterator->second.h += iterator->first * t;
			sum += iterator->second.c * MAX(0, iterator->second.h - b);
			iterator->second.h = MIN(iterator->second.h, b);
		}

		printf("%lld\n", sum);
	}

	return 0;
}