#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "debug.hpp"
#else
#define debug(...) 8
#endif
typedef long long ll;
#define f(i, x, n) for (ll i = x; i < n; i++)
#define rf(i, x, n) for (ll i = x; i >= n; i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
const ll p = 1e9 + 7;
const ll inf = 1e18;
const ll N = 2e5 + 5;
void solve() {
ll n;
cin >> n;
vector<pair<ll,ll>> a(n);
f(i,0,n) cin >> a[i].F >> a[i].S;
ll l=0, r=n+1, ans=-1;
while(l<=r) {
ll mid = (l+r)/2;
ll cnt=0;
f(i,0,n) {
if(a[i].F>=mid-cnt-1 && cnt<=a[i].S) cnt++;
}
if(cnt >= mid) {
l=mid+1;
ans=mid;
}
else {
r=mid-1;
}
}
cout << ans << '\n';
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
cin >> T;
while (T--)
solve();
return 0;
}
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |