Binge watching

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

struct sort_pred {
    bool operator()(const std::pair<int, int> &left, const std::pair<int, int> &right) {
        return left.second < right.second;
    }
};

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

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

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

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

    //(for (int i = 0; i < n; ++i) cout << '('  << movies[i].first << ' ' << movies[i].second << ')' << endl;

    long int nmovies = 1;

    int last_end = movies[0].second;
    for (int i = 0; i <= n; ++i) {
        int startc = movies[i].first, endc = movies[i].second;

        //cout << "comp" << last_end <<  ' ' << startc << endl;
        if (last_end <= startc) {
            ++nmovies;
            last_end = endc;
        }
    }

    cout << nmovies << endl;
}

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