Binge watching

def function(n, movies):

    movies.sort(key=lambda x: x[1])
    dp = [0] * (n + 1)
    dp[0] = 0
    dp[1] = 1
    for i in range(2, n + 1):
        dp[i] = dp[i - 1]
        for j in range(i - 1, 0, -1):
            if movies[j - 1][1] <= movies[i - 1][0]:
                dp[i] = max(dp[i], dp[j] + 1)
                break
        else:
            dp[i] = max(dp[i], 1)
    return dp[n]


def main():
    # input :
    # 3
    # 3 5
    # 4 9
    # 5 8

    n = int(input())
    movies = []

    for _ in range(n):
        a, b = map(int, input().split())

        movies.append([a, b])


    result = function(n, movies)
    print(result)



if __name__ == "__main__":
    main()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED