Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) A Math Problem

//只要从所有区间右端点的最小值覆盖到所有区间左端点的最大值即可
#include<iostream>
using namespace std ;
int x,y;
int n;
int t;
int main() {
    cin>>t;
    while(t--) {
        cin>>n;
        if(n==1) {
            cin>>x>>y;
            cout<<0<<endl;
        } else {
            int l=0,r=1e9+10;
            for(int i=1; i<=n; i++) {
                cin>>x>>y;
                l=max(l,x);
                r=min(r,y);
            }
            int ans=max(0,l-r);
            cout<<ans<<endl;
        }
    }
    return 0;
}