Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- #include <math.h>
- using namespace std;
- vector <pair<int, int>> k;
- int getmin(int v, int l, int r, int L, int R, vector<int> &d) {
- if (l > R || r < L)
- return 1000 * 1000 * 1000;
- if (l >= L && r <= R)
- return d[v];
- int m1 = getmin(2 * v + 1, l, (l + r) / 2, L, R, d);
- int m2 = getmin(2 * v + 2, (l + r) / 2 + 1, r, L, R, d);
- return min(m1, m2);
- }
- int main() {
- ios_base::sync_with_stdio(false);
- int n;
- cin >> n;
- vector <int> v(n);
- for (int i = 0; i < n; i++)
- cin >> v[i];
- int m;
- cin >> m;
- k.resize(m);
- for (int i = 0; i < m; i++) {
- int a, b;
- cin >> a >> b;
- k[i] = { a, b };
- }
- sort(k.begin(), k.end());
- vector <int> kk(m);
- for (int i = 0; i < m; i++) {
- kk[i] = k[i].first;
- }
- //sort(kk.begin(), kk.end());
- int N = pow(2, ceil(log2(m)));
- vector <int> d(2 * N - 1, 1000 * 1000 * 1000);
- for (int i = d.size() / 2; i < d.size() / 2 + m; i++)
- d[i] = k[i - d.size() / 2].second;
- for (int i = d.size() / 2 - 1; i >= 0; i--)
- d[i] = min(d[2 * i + 1], d[2 * i + 2]);
- long long ans = 0;
- for (int i = 0; i < n; i++) {
- int c = lower_bound(kk.begin(), kk.end(), v[i]) - kk.begin();
- ans += getmin(0, d.size() / 2, d.size() - 1, c + d.size() / 2, d.size() - 1, d);
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement