Binge watching

import sys

def solve():
    input = sys.stdin.read().split()

    n = int(input[0])
    beg = []
    end = []
    i = 1 
    for _ in range(n): 
        b = int(input[i])
        e = int(input[i+1])
        beg.append(b)
        end.append(e)
        i +=2

    beg.sort()
    end.sort()
    max = 1
    i = 1
    j = 0 
    while i<n and j<n : 
        b = beg[i]
        e = end[j]
        if e>b : 
            i +=1 
        elif e<=b: 
            j+=1
            max+=1
    return max
        


if __name__ == '__main__': 
    print(solve())

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