Submission #230455

---

Source Code Expand

#include <iostream>
#include <string>
#include <deque>
#include <queue>
#include <map>
#include <stdint.h>
#include <vector>
#include <algorithm>

using namespace std;

typedef pair<int, int> P;

int main() {
  uint64_t a,b,n;
  vector<uint64_t> v(1000001, 0);
  cin >> n;
  while(n-- > 0) {
    cin >> a >> b;
    for (; a <= b; a++) {
      v[a]++;
    }
  }
  cout << *max_element(v.begin(), v.end()) << endl;
}

Submission Info

Judge Result