Binge watching

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

pair<int,int> A[200'001];
int n;

int main() {
	cin >> n;
	for (int i = 0; i < n; ++i) {
		int a, b;
		cin >> a >> b;
		A[i] = {b,a};
	}
	sort(A,A+n);
	int ans = 0;
	int l = 0;
	for (int i = 0; i < n; ++i) {
		if (l <= A[i].second) {
			l = A[i].first;
			++ans;
		}
	}
	cout << ans;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED