Binge watching

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

using namespace std;
int main(){
    int n;
    cin >> n;
    vector<pair<int,int>> movies(n);
    for(int i = 0; i < n; ++i){
        int start, ending;
        cin >> start >> ending;
        movies[i] = make_pair(start,ending);
    }
    sort(movies.begin(), movies.end());
    /*for(int i = 0; i < n; ++i){
        cout<<movies[i].first << ' '<< movies[i].second<<endl;
    }*/
    int total = 0;
    int end = 0;
    if(n > 0){
        ++total;
        end = movies[0].second;

    }
    for(int i = 1; i < n; ++ i){
        if(movies[i].first >= end){
            ++total;
            end = movies[i].second;
        }
    }
    cout << total<<endl;
}

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: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED