Submission #4062633

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <functional>
#include <map>
#include <set>

#define INF 1000000000;
#define MOD 1000000007;
typedef long long ll;
using namespace std;

ll fn(ll m, ll a) {
    return m % a;
}

int main()
{
    int N; cin >> N;
    vector<int> imos(1000005, 0);
    for (int i = 0; i < N; i++) {
        int a, b; cin >> a >> b;
        imos[a]++;
        imos[b + 1]--;
    }
    for (int i = 0; i < (int)imos.size(); i++) {
        imos[i + 1] += imos[i];
    }

    int ans = *max_element(imos.begin(), imos.end());
    cout << ans << endl;
}

Submission Info

Judge Result