Submission #1592249

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    const int m = 1000000;
    vector<int> v1(m+3, 0), v2(m+3, 0);
    for(int i=0; i<n; i++){
        int a, b;
        cin >> a >> b;
        a++; b++;
        v1[a]++;
        v1[b+1]--;
    }
    for(int i=1; i<m+3; i++)
        v2[i] = v2[i-1] + v1[i];
    int ans = 0;
    for(int i=1; i<=m+1; i++)
        ans = max(ans, v2[i]);
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result