Submission #2233110

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> count(1000000 + 2, 0);
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    ++count[a];
    --count[b + 1];
  }
  int ret = count[0];
  int v = 0;
  for (int c : count) {
    v += c;
    ret = max(ret, v);
  }
  cout << ret << "\n";
  return 0;
}

Submission Info

Judge Result