#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#define fi first
#define se second
#define mp make_pair

using namespace std;
using ll = long long;
using pii = pair<int, int>;

constexpr double eps = 1e-8;
constexpr int NINF = 0xc0c0c0c0;
constexpr int INF = 0x3f3f3f3f;
constexpr ll mod = 1e9 + 7;
constexpr ll N = 1e6 + 5;

void solve() {
    int n;
    cin >> n;
    vector<pair<int,int> > a(n);
    vector<int> L(n), R(n);
    ll ans = n - 1;
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        a[i].first = L[i] = x;
        a[i].second = R[i] = y;
    }
    sort(L.begin(), L.end());
    sort(R.begin(), R.end());
    for (auto [l,r] : a) {
        ll cnt = lower_bound(R.begin(), R.end(), l) - R.begin();
        cnt += L.end() - upper_bound(L.begin(), L.end(), r);
        ans = min(ans, cnt);
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}