Submission #7491362

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)

typedef long long ll;

const int Inf = 1e9;
const double EPS = 1e-9;

int gcd(int a, int b) {
    if (b == 0) {
        return a;
    } else {
        return gcd(b, a % b);
    }
}

int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

int bitCount(long bits) {
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
    return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    int MAX = 1000010;
    cin >> n;
    vector<int> a(MAX);
    rep (i, n) {
        int l, r;
        cin >> l >> r;
        a[l]++;
        a[r + 1]--;
    }
    FOR (i, 1, MAX) {
        a[i] += a[i - 1];
    }
    int ans = -1;
    rep (i, MAX) {
        ans = max(ans, a[i]);
    }
    cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result