Submission #3972520

---

Source Code Expand

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

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
int field[1000200];
int main() {
    //cout.precision(10);
    int n;
    cin >> n;
    for(int i = 0; i < n; i++){
        int a, b;
        cin >> a >> b;
        field[a]++;
        field[b + 1]--;
    }
    for(int i = 0; i <= 1000000; i++){
        field[i + 1] += field[i];
    }
    int ans = 0;
    for(int i = 1; i <= 1000000; i++){
        ans = max(ans, field[i]);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result