Submission #1240599

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<math.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
const long double pi = 3.14159265358979323846264338327950288;
int a[1000002], n;
int main(){
	cin >> n;
	for (int i = 0; i < n; i++) {
		int b, c;
		cin >> b >> c;
		a[b]++;
		a[c + 1]--;
	}
	int sum = 0;
	for (int i = 0; i < 1000000; i++) {
		a[i + 1] += a[i];
	}
	for (int i = 0; i <= 1000000; i++) {
		sum = max(sum, a[i]);
	}
	cout << sum << endl;
	cin >> n;
}

Submission Info

Judge Result