28018번: 시간이 겹칠까? ↗

/*
[28018: 시간이 겹칠까?](https://www.acmicpc.net/problem/28018)

Tier: Gold 5 
Category: prefix_sum, difference_array
*/


#include <bits/stdc++.h>

using namespace std;

#define for1(s, e) for(int i = s; i < e; i++)
#define for1j(s, e) for(int j = s; j < e; j++)
#define forEach(k) for(auto i : k)
#define forEachj(k) for(auto j : k)
#define sz(vct) vct.size()
#define all(vct) vct.begin(), vct.end()
#define uniq(vct) sort(all(vct));vct.erase(unique(all(vct)), vct.end())
#define fi first
#define se second

typedef unsigned long long ull;
typedef long long ll;
typedef unsigned int uint;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<double, int> pdi;
typedef pair<string, string> pss;

typedef vector<ll> llv1;


const double EPS = 1e-8;
const double PI = acos(-1);

template<typename T>
T sq(T x) { return x * x; }

int sign(ll x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(int x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(double x) { return abs(x) < EPS ? 0 : x < 0 ? -1 : 1; }

void solve() {
  ll N, Q;
  llv1 diff;
  
  cin >> N;
  diff.resize(1100000, 0);

  for1(0, N) {
    ll a, b;

    cin >> a >> b;
    diff[a]++;
    diff[b + 1]--;
  }


  for1(1, 1100000) {
    diff[i] += diff[i - 1];
  }

  cin >> Q;

  for1(0, Q) {
    ll a;

    cin >> a;

    cout << diff[a] << "\n";
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);cout.tie(NULL);
  int tc = 1; // cin >> tc;
  while(tc--) solve();
  
}