Submission #1772132

---

Source Code Expand

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

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define ll long long

int cust[1000009];

int main() {
    int n;
    cin >> n;

    int Max = -1;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        cust[a]++;
        cust[b+1]--;
        Max = max(Max, b+1);
    }

    vector<int> t(Max + 1);
    for (int i = 1; i <= Max; i++) {
        t[i] = t[i-1] + cust[i-1];
    }

    sort(t.begin(), t.end());

    cout << t.back() <<endl;

    return 0;
}

Submission Info

Judge Result