Submission #582955

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (int)(n); ++(i))
#define rep1(i, n) for(int (i) = 1; (i) <= (int)(n); ++(i))
#define rrep(i, n) for(int (i) = (n) - 1; (i) >= 0; --(i))
#define all(a) (a).begin(),(a).end()
#define PB push_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<double>> vvd;
typedef pair<int, int> P;
const int INF = 0x7fffffff;
const ll divisor = 1000000007;

const int MAX_T = 100000;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin >> N;
  vector<P> ST(N);
  vi imos(MAX_T + 1);
  for(auto &p : ST){
    cin >> p.first >> p.second;
    imos[p.first]++;
    imos[p.second]--;
  }
  rep1(i, MAX_T) imos[i] += imos[i - 1];
  
  int imosmax = 0;
  rep1(i, MAX_T){
    if(imos[i] > imosmax) imosmax = imos[i];
  }
  int left = -1, right;
  rep1(i, MAX_T){
    if(imos[i] == imosmax){
      if(left == -1) left = i;
      right = i;
    }
  }
 
  for(auto &p : ST){
    if(p.first <= left && right < p.second){
      cout << imosmax - 1 << endl;
      return 0;
    }
  }
  cout << imosmax << endl;
  return 0;
}

Submission Info

Judge Result