Binge watching

using namespace std;

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

int main(){

    int n; 

    cin >> n;
    int aux1, aux2;
    vector< pair<int, int> > v;

    for (int i = 0; i < n ; ++i){
        cin >> aux1 >> aux2;
        v.push_back(make_pair(aux1, aux2));
    }

    sort(v.begin(), v.end(), [](pair<int,int> &left, pair<int,int> &right) {
        return left.second < right.second;
    });

    int count = 0;
    int end = 0;
    for (int i = 0; i < n; ++i){
        if (end <= v[i].first){
            end = v[i].second;
            count++;
        } 
    }

    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