CUBE-T026: Durian Company

#include <bits/stdc++.h>
using namespace std;

struct event {
    int tme, add;
    event(){}
    event(int t, int a){
        tme = t;
        add = a;
    }
    bool operator < (const event &rhs) const{
        if(tme != rhs.tme){
            return tme < rhs.tme;
        } else {
            return add > rhs.add;
        }
    }
};

vector<event> events;

int main(){

    int nPeople;
    scanf("%d", &nPeople);
    for(int i = 1; i <= nPeople; ++i){
        int st, ed;
        scanf("%d%d", &st, &ed);
        events.emplace_back(st, 1);
        events.emplace_back(ed, 2);
    }
    sort(events.begin(), events.end());

    int cnt = 0;
    int mx = 0;
    for(event e : events){
        int tme = e.tme;
        int add = e.add;
        if(add == 1){
            ++cnt;
            mx = max(mx, cnt);
        } else {
            --cnt;
        }
    }
    cout << mx;

    return 0;
}