Submission #4402754

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<cmath>
#include<iomanip>
#include<set>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;

//ザ・いもす法
const int mm = 1000000;
int main() {
    int n; cin >> n;
    int enogu[mm + 2] = {0};
    int mmax = 0;
    rep(i, n) {
        int a, b; cin >> a >> b;
        mmax = max(max(mmax, a), b);
        enogu[a]++;
        enogu[b + 1]--;
    }
    rrep(i, 1, mmax + 1) enogu[i] += enogu[i - 1];
    int ans = 0;
    rep(i, mmax + 1) ans = max(ans, enogu[i]);
    cout << ans << endl;
    
    
}

Submission Info

Judge Result