해당 문제 다른 풀이에 대한 질문입니다.

import java.io.*;
import java.util.*;

class Time implements Comparable<Time> {
    int startTime, endTime;

    public Time(int startTime, int endTime) {
        this.startTime = startTime;
        this.endTime = endTime;
    }

    @Override
    public int compareTo(Time time) {
        if (this.endTime == time.endTime) {
            return this.startTime - time.startTime;
        } else {
            return this.endTime - time.endTime;
        }
    }
}

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());

        List<Time> times = new ArrayList<>();

        StringTokenizer st;
        int startTime, endTime;
        for (int i = 0; i < n; i++) {
            st = new StringTokenizer(br.readLine());
            startTime = Integer.parseInt(st.nextToken());
            endTime = Integer.parseInt(st.nextToken());

            times.add(new Time(startTime, endTime));
        }

        System.out.print(solution(times));
    }

    private static int solution(List<Time> times) {
        int answer = 0;
        int endTime = 0;
        int count = 1;

        Collections.sort(times);

        for (Time time : times) {
            if (time.startTime < endTime) {
                count++;
            } else {
                answer = Math.max(answer, count);
                count = 1;
                endTime = time.endTime;
            }
        }

        return answer;
    }
}

이렇게 로직을 구현했는데, 왜 오답 처리되는지 궁금합니다.
다른 예외 케이스가 존재할까요?