Binge watching

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<pair<int, int>> movies(n);

    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        movies[i] = {b, a};
    }

    sort(movies.begin(), movies.end());

    int count = 0;
    int last_end_time = 0;

    for (int i = 0; i < n; i++) {
        int start = movies[i].second;
        int end = movies[i].first;

        if (start >= last_end_time) {
            count++;
            last_end_time = end;
        }
    }

    cout << count << "\n";

    return 0;
}

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