Binge watching

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

bool sortByEndTime(std::pair<int, int>& p1, std::pair<int, int>& p2) {
    return p1.second < p2.second;
}

int main() {
    
    int n;
    std::cin >> n;
    std::vector<std::pair<int, int>> movies;

    for (int i = 0; i < n; i++) {
        int a, b;
        std::cin >> a >> b;
        
        std::pair<int,int> p;
        p = std::make_pair(a, b);
        movies.push_back(p);
    }

    // sort according to end time of movies
    sort(movies.begin(), movies.end(), sortByEndTime);

    int current_time = 0;
    int movie_cnt = 0;

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

    std::cout << movie_cnt << std::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