Submission #101807

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int N, M;
	cin >> N >> M;
	pair<int,int> p[N];
	for(int i = 0; i < N; ++i) {
		cin >> p[i].second >> p[i].first;
	}
	sort(p, p+N);
	int res = 0;
	for(int i = 0, j = 0; i < N; ++i) {
		int s = p[i].second;
		int t = p[i].first;
		if(j <= s) {
			j = t;
			++res;
		}
	}
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result