Submission #1626085

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int n,a,b,li[1000001];

int main(){
	cin >> n;
	REP(i,0,n){
		cin >> a >> b;
		li[a]++; li[b+1]--;
	}
	
	
	REP(i,1,1000001) li[i]+=li[i-1];
	sort(li,li+1000001); reverse(li,li+1000001);
	
	cout << li[0] << endl;
	return 0;
}

Submission Info

Judge Result