#include #include #define rep(i,n) for(int i=0;i vi; typedef vector vl; typedef vector> vvi; typedef vector> vvl; typedef long double ld; typedef pair P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const static_modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const dynamic_modint& a) {os << a.val(); return os;} template istream& operator>>(istream& is, vector& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template ostream& operator<<(ostream& os, const pair& p){os << p.first << ' ' << p.second; return os;} template ostream& operator<<(ostream& os, const vector& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const vector>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template void chmin(T& a, T b){a = min(a, b);} template void chmax(T& a, T b){a = max(a, b);} int main(){ int n; cin >> n; vector

lr; vector

rl; rep(i, n){ int l, r; cin >> l >> r; lr.emplace_back(l, r); rl.emplace_back(r, l); } int mn = 0; sort(lr.begin(), lr.end(), [](P left, P right){ return left < right; }); rep(i, n){ auto [l, r] = lr[i]; // cout << l << ' ' << r << "\n"; chmax(mn, l - (i + 1)); if(mn + (i + 1) > r){ cout << "0\n"; return 0; } } int mx = 1001001001; sort(rl.begin(), rl.end(), [](P left, P right){ return left > right; }); rep(i, n){ auto [r, l] = rl[i]; // cout << l << ' ' << r << "\n"; chmin(mx, r - (n - i)); if(mx + (n - i) < l){ cout << "0\n"; return 0; } } // cout << mn << ' ' << mx << "\n"; int ans = max(mx - mn + 1, 0); cout << ans << "\n"; return 0; }