#include #define mp make_pair #define pb push_back using namespace std; using ll = long long int; template ostream& operator+(ostream& out, const vector &vec){ for(const auto &x : vec){ out< ostream& operator*(ostream& out, const vector &vec){ for(const auto &x : vec){ out+x; } return out; } template istream& operator>>(istream& in, vector &vec){ for(auto &x : vec){ in>>x; } return in; } void solve(){ int n; cin>>n; vector> a(n); vector> events; for(auto &[r, R] : a){ cin>>r>>R; if(r == R) continue; events.push_back({r, 1}); events.push_back({R, -1}); } sort(events.begin(), events.end()); int ans = 0, cnt = 0; for(auto &[v, p] : events){ cnt += p; ans = max(ans, cnt); } cout<