Binge watching

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

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

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

    // Read all times
    vector<pair<int, int>> times(n);
    for (int i = 0; i < n; ++i) {
        cin >> times[i].first >> times[i].second;
    }

    // Sort by movie duration
    sort(times.begin(), times.end(), comp);

    // Count 
    int count = 1;
    int last = times[0].second;

    for (int i = 1; i < n; ++i) {
        if (times[i].first >= last) {
            count++;
            last = times[i].second;
        }
    }

    cout << count << 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