Submission #2205535

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define erep(i,a,b) for(int i=a;i<=(int)(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>(a);i--)
#define eper(i,a,b) for(int i=((int)(a));i>=b;i--)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
const int INF=(1<<30)-1;
const int MOD=1000000007;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}

const int MAX = 1000005;
int n, cons[MAX], ans;  
int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> n;
    rep(i, 0, n) {
        int a, b;
        cin >> a >> b;
        cons[a]++, cons[b+1]--;
    }
    rep(i, 0, MAX) {
        if (i > 0) cons[i] += cons[i-1];
    }
    rep(i, 0, MAX)
        ans = max(ans, cons[i]);
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result