Stolici (jboi) za 7/10

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

typedef pair<int, int> pii;

inline int parse(string &s, int i) {
    return 10*(s[i]-'0') + s[i+1]-'0';
}

bool comp(const pii &a, const pii &b) {
    return a.first < b.first;
}

int main() {
//    std::ios::sync_with_stdio(false);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    int n;
    cin >> n;
    vector<pii> events;
    for (int i = 0; i < n; ++i) {
        string a, b; //xx:xx:xx
        cin >> a >> b;
        pii enter(parse(a,0)*60*60 + parse(a,3)*60 + parse(a,6), 1);
        pii leave(parse(b,0)*60*60 + parse(b,3)*60 + parse(b,6), 2);
        events.push_back(enter);
        events.push_back(leave);
    }
    sort(events.begin(), events.end(), comp);
    int maxi = 0, curr = 0;
    for (pii p : events) {
        int e = p.second;
        if (e == 1) {
            ++curr;
        } else if (e == 2) {
            maxi = max(maxi, curr);
            --curr;
        }
    }
    maxi = max(maxi, curr);
    cout << maxi;
}