Untitled

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> starts, ends;
    for(int i=0;i<n;i++) {
        int start, end;
        cin >> start >> end;
        starts.push_back(start);
        ends.push_back(end);
    }
    sort(starts.begin(), starts.end());
    sort(ends.begin(), ends.end());
    int i=0, j=0;
    int current=0;
    int max_seats=0;
    while(i<n && j<n) {
        if(starts[i]<ends[i]) {
            current++;
            i++;
            if(current>max_seats) {
                max_seats=current;
            }
            else {
                current--;
                j++;
            }
        }
    }
    cout << max_seats;
    return 0;
}