Submission #1318497

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <functional>
#include <cmath>
#include <algorithm>

using namespace std;

typedef pair<int, int> P;

int main() {
	int n;
	cin >> n;
	int s, t;
	vector<P> v(n);
	vector<int> aa(100010, 0);
	for (int i = 0; i < n; i++) {
		cin >> s >> t;
		v[i] = P(s, t);
		aa[s]++;
		aa[t]--;
	}

	for (int i = 1; i < 100010; i++) {
		aa[i] += aa[i - 1];
	}

	int MAX = 0;
	for (int i = 1; i < 100010; i++) {
		MAX = max(MAX, aa[i]);
	}
	int ll, rr;
	ll = rr = -1;
	for (int i = 1; i < 100010; i++) {
		if (aa[i] == MAX) {
			if (ll == -1) {
				ll = rr = i;
			}
			else {
				rr = i;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		if (v[i].first <= ll && rr < v[i].second) {
			MAX--;
			break;
		}
	}
	cout << MAX << endl;
	return 0;
}

Submission Info

Judge Result