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
#include <iostream>
#include <vector>
#include <chrono>
#include <map>

using namespace std;

int main()
{
	auto start = chrono::steady_clock::now();

	int n;
	int m;
	int z;
	cin >> n >> m >> z;

	vector<int> days;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		days.push_back(a);
	}

	vector<long long> leafes(n, 0);
	//map<pair<int, int>, long long> sums;
	for (int i = 0; i < m + z; i++)
	{
		int kind;
		int p;
		int w;
		cin >> kind >> p >> w;

		if (kind == 1) {
			for (int j = 0; j < p; j++)
			{
				leafes[j] += w;
			}
		}
		if (kind == 2) {
			long long sum = 0;
			for (int j = 0; j < p; j++)
			{
				if (days[j] >= w)
				{
					sum += leafes[j];
				}
			}
			cout << sum << endl;
		}
	}

	auto end = chrono::steady_clock::now();
	chrono::duration<double> elapsed_seconds = end - start;
	//cout << "Czas: " << elapsed_seconds.count() << endl;

	cin >> n;
}