Submission #1606181

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}

ll t[100005];//0使わないと

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

  ll N; cin >> N;
  vector<ll> st,tt;
  rep(i,N){
    ll si,ti; cin >> si >> ti;
    t[si]++;
    t[ti]--;
    st.pb(si);tt.pb(ti);
  }

  ll l=0, r=0;
  ll MAX = 0;
  ll now = 0;
  FOR(i,1,100000){
    now += t[i];
    if(now > MAX) {
      l = i;
      MAX = now;
    }
    else if(now == MAX) r = i;
  }
  r++;



  rep(i,N){
    if(st[i]<=l && r <= tt[i]){
      cout << MAX-1 << endl;
      return 0;
    }
  }

  cout << MAX << endl;
  return 0;
}

Submission Info

Judge Result