Binge watching

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

using namespace std;

    bool comparator (pair<int,int> &a, pair<int,int> &b){
        if (a.second<b.second){
            return true;
        } else if (a.second==b.second){
            return ((a.second-a.first)<(b.second-b.first));
        } else {
            return false;
        }
    }


int main(){

    int n;

    cin >> n;
    vector<pair<int,int>> arr(n);
    for (int i=0;i<n;i++){
        int a, b;
        cin >> a >> b;
        arr[i] = {a, b};
    } 

    sort(arr.begin(),arr.end(), comparator);
    int count=0;
    int currPos=0;
    for (auto &p: arr){
        if (currPos>p.first){
            continue;
        } else {
            currPos=p.second;
            count++;
        }
    }
    cout << count << '\n';
    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