Binge watching

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

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<int, int>> v;

    for (int i = 0; i < n; i++){
        int a, b;
        cin >> a >> b;
        
        v.push_back({a,b});
    }
    sort(v.begin(), v.end(), sort_pred());
    
    int count = 1;
    int start;
    int end = v[0].second;
    for (int i = 1; i < n; i++){
        start = v[i].first;
        if (end <= start){
            count++;
            end = v[i-1].second;
        }
    }
    cout << count;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED