#pragma GCC optimize(3,"Ofast","inline")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll; 
#define int long long
#define ld long double
int n,k;
int sum=0;
int id=0;
struct node{
	int v,w;
}a[100010];
bool operator<(node z,node y){
	return z.v<y.v;
}
vector<int>tz,ty;
bool check(int x){
tz.clear(),ty.clear();
	for(int i=1;i<=n;i++){
		if(a[i].v<x){
			tz.push_back(a[i].w);
		}else{
			int ti=a[i].v-x;
			ti+=a[i].w;
			ty.push_back(ti);
		}
	}
if(tz.size()>ty.size()) return 0;
int zid=tz.size()-1;
int yid=ty.size()-1;
 while(zid>=0){
 	if(tz[zid]>ty[yid]) return 0;
zid--,yid--;
 }
return 1;
	
}
void solve()
{ 
 cin>>n;
 for(int i=1;i<=n;i++){
 	cin>>a[i].v>>a[i].w;
 }
	//sort(a+1,a+1+n);
   int l=1,r=1e9+1;
	while(l<r){
		int mid=(l+r+1)/2;
		if(check(mid)) l=mid;
		else r=mid-1;
	}
cout<<l<<endl;
}

signed main()
{
	ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
	int t; cin>>t;
	while(t--)
{
	solve();
}
	
	
	return 0;
}