Binge watching

#include <bits/stdc++.h>

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] = {a, b};
    }

    auto comp = [](pair<int, int> p1, pair<int, int> p2) {
        return p1.second < p2.second;
    };

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

    int current_end = -1;
    int attended = 0;

    for (int i = 0; i < n; i++) {
        if (movies[i].first >= current_end) {
            current_end = movies[i].second;
            attended++;
        }
    }

    cout << attended << endl;


    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