Submission #4655058

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <stack>
using namespace std;
#define ll int64_t
const long mod = 1e9 + 7;


const long LINF = 1e13;
const long LLINF = 1e18;
const long ALPHABET = 26;

template <class T>
void Swap(T& r, T& l) {
  T tmp = r;
  r = l;
  l = tmp;
}

template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
  for (T& x : vec) is >> x; //for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
  return is;
}




int main() {

  long n,  c, t, m;

  cin >> n;


  vector<pair<long, long>> ab(n);

  vector<long> aa(n);
  vector<long> bb(n);

  for (int i = 0; i < n; ++i) {
    long a, b;
    cin >> a >> b;
    ab[i] = make_pair(a, b);
    aa[i] = a;
    bb[i] = b;
  }

  sort(ab.begin(), ab.end(), [](pair<long, long> &l, pair<long, long>&r) {
    return l.first < r.first;
  });

  sort(aa.begin(),aa.end());
  sort(bb.begin(),bb.end());


  long ans = 0;


  long count = 0;
  long r = 0;
  for (int i = 0; i < n; ++i) {
    count++;
    // cerr << ab[i].first <<endl;
    while (true) {
      // if (ab[i].first > ab[r].second) {
      if (aa[i] > bb[r]) {
        r++;
        count--;
      } else {
        break;
      }
    }
    

    ans = max(ans, count);

  }


  cout <<  ans  << endl;



}

Submission Info

Judge Result