Submission #1367867

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;
 
int main() {
  int n;
  cin >> n;
  int a[1000001][2];
  memset(a,0,sizeof(a));
  rep(i,n) {
    int x,y;
    cin >> x >> y;
    a[x][0]++;
    a[y][1]++;
  }
  int d=0,ans=0;
  rep(i,1000001) {
    d+=a[i][0];
    ans=max(ans,d);
    d-=a[i][1];
  }
  pr(ans);
  return 0;
}

Submission Info

Judge Result