Binge watching

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



bool cmp(std::pair<int, int> a, std::pair<int, int> b){
  return a.second < b.second;
}

int main(){
  int n;
  std::cin >> n;
  std::vector<std::pair<int, int>> intervals(n);
  for (int i = 0; i<n; ++i){
    std::cin >> intervals[i].first >> intervals[i].second;
  }
  std::sort(intervals.begin(), intervals.end(), cmp);
  int prevEnd = intervals[0].second;
  int count = 1;
  for (int i = 1; i<n; ++i){
    if (intervals[i].first>=prevEnd){
      prevEnd = intervals[i].second;
      count++;
    }
  }

  std::cout << count << "\n";
}

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