Fast Search

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

#define cin(vec) for(auto& i : vec) cin >> i
#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n)+1)
#define all(vec) vec.begin(),vec.end()
#define rall(vec) vec.rbegin(),vec.rend()
#define sz(x) int(x.size())
#define TC int t; cin >> t;   while(t--)
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

void Code_Crush(){
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  #endif
}

int upper_bound(vector < int >& nums, int target){
  int l = 0, r = sz(nums) - 1, best = sz(nums);
  while(l <= r){
    int m = l + (r - l) / 2;
    (nums[m] > target ? r = m - 1, best = m : l = m + 1);
  }
  return best;
}

int lower_bound(vector < int >& nums, int target){
  int l = 0, r = sz(nums) - 1, best = -1;
  while(l <= r){
    int m = l + (r - l) / 2;
    (nums[m] < target ? l = m + 1, best = m : r = m - 1);
  }
  return best;
}

int main(){
  Code_Crush();
  int n, k, l, r;
  cin >> n;
  vector < int > nums(n);
  cin(nums);
  sort(all(nums));
  cin >> k;
  while(k-- && cin >> l >> r){
      cout << upper_bound(nums, r) - lower_bound(nums, l) - 1 << " ";
  }
  Time
  return 0;
}