Submission #1317644

---

Source Code Expand

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

using namespace std;

typedef pair<int, int> P;

int main() {
	int n;
	cin >> n;
	int s, t;
	priority_queue<P, vector<P>, greater<P> > pq;
	for (int i = 0; i < n; i++) {
		cin >> s >> t;
		pq.push(P(t, s));
	}
	int ans, nn;
	ans = nn = 0;
	while (nn < n - 1) {
		ans++;
		priority_queue<P, vector<P>, greater<P> > pq2;
		while (!pq.empty()) {
			P p = pq.top();
			pq.pop();
			nn++;
			while (!pq.empty()) {
				P pp = pq.top();
				pq.pop();
				if (pp.second >= p.first) {
					nn++;
					p = pp;
				}
				else {
					pq2.push(pp);
				}
			}
		}
		pq = pq2;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result