Submission #1671466

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>
 
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000001
 
using namespace std;
 
 
 
int main(void) {
	int n;
	int a, b;
 
	cin >> n;
	vector<int>count(1000002, 0);
	FOR(i, 1, n) {
		cin >> a >> b;
		count[a]++;
		count[b+1]--;
		
		
	}
	
	FOR(i,1,1000001){
	  count[i]+=count[i-1];
	  }
	
	sort(count.begin(), count.end());
	cout << count[1000001] << endl;
	return 0;
}

Submission Info

Judge Result