#include<bits/stdc++.h>
#define fast  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define arin(x,n) for(int i=0;i<n;i++)cin>>x[i]
#define debug(x,n) for(int i=0;i<n;i++)cout<<x[i]<<" "
#define pb push_back
#define all(c) begin(c), end(c)
#define isAll(c) (int)(c).size()
typedef long long int ll;
 
using namespace std;

int solve(vector <pair<int, int>> &arr)
{
    int num = isAll(arr);
    vector <int> lc(num); 
    vector <int> rc(num);

    for (int i = 0; i < num; i++)
        lc[i] = arr[i].first, rc[i] = arr[i].second;

    sort(all(lc)), sort(all(rc));

    int result = 1e9 + 7;
    for (auto [l, r] : arr)
    {
        int result_l = distance(begin(rc), lower_bound(all(rc), l)),
            result_r = distance(upper_bound(all(lc), r), end(lc));
              result = min(result, result_l + result_r);
    }
    return result;
}
 
int main()
{
	fast;
	ll T=1;
	cin>>T;
	while(T--)
	{
		int num;
		cin >> num;

		vector <pair<int, int>> arr(num);
		for(auto &[x, y] : arr) 
			cin >> x >> y;
		
	    cout << solve(arr) << endl;
	}
	return 0;
}
 