#include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define ll long long bool cmp(PII a, PII b) { return a.second < b.second; } void solve() { int n, m; cin >> n; vector<PII> a(n); for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; a[i] = { x, y }; } cin >> m; vector<PII> b(m); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; b[i] = { x, y }; } sort(a.begin(), a.end(), cmp); for (int i = 0; i < m; i++) { int l = 0, r = n - 1; int cnt = 0; while (l < r) { int mid = (l + r) / 2; if (a[mid].second > b[i].first) r = mid; else l = mid + 1; } if (a[l].second > b[i].first) l--; for (int j = 0; j <= l; j++) { if (b[i].second >= a[j].first) cnt++; } cout << cnt << endl; } } int main() { solve(); return 0; }