Envío 5574

Código

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

void _print() { cerr << "]" << endl; }
template<typename T, typename... V>
void _print(T t, V... v) { cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifdef LOCAL
    #define dbg(x...) cerr << "[" << #x << "]: ["; _print(x)
#else
    #define dbg(x...)
    #define endl '\n'
#endif
#define ll long long
#define sz(x) int(x.size())
#define ii pair<int, int>
#define ff first
#define ss second

struct clase {
    ii in, fi;

    bool operator < (const clase &o) const {
        if (fi == o.fi) return in >= o.in;
        return fi > o.fi;
    }
};

ii separar(string s) {
    ii x;
    x.ff = stoi(s.substr(0, 2));
    x.ss = stoi(s.substr(3));
    return x;
}

clase get_clase(string a, string b) {
    return {separar(a), separar(b)};
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    vector<clase> arr;
    for (int i = 0; i < n; ++i) {
        string a, b; cin >> a >> b;
        arr.push_back(get_clase(a, b));
    }
    sort(arr.begin(), arr.end());
    priority_queue<clase> pq;
    for (int i = 0; i < n; ++i) {
        if (sz(pq) && pq.top().fi <= arr[i].in) pq.pop();
        pq.push(arr[i]);
    }
    cout << sz(pq) << endl;
    return 0;
}