Submission #4038747

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
 
const int INF = 1e9;
const int mod = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1.0);

int cnt[1000010];

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

    int ans = cnt[0];
    for(int i = 1; i < 1000010; i++){
        cnt[i] += cnt[i-1];
        ans = max(ans,cnt[i]);
    }
    
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result