impl Solution {
    pub fn max_two_events(events: Vec<Vec<i32>>) -> i32 {
        let mut events = events;

        // Sort events by end time in descending order
        events.sort_by(|a, b| b[1].cmp(&a[1]));

        let n = events.len();
        let mut max_vals = vec![0; n + 1]; // To store max values from right to left

        // Populate max_vals array with maximum values from right to left
        for i in (0..n).rev() {
            max_vals[i] = max_vals[i + 1].max(events[i][2]);
        }

        let mut best = 0;

        // Iterate over each event to find the best combination
        for i in 0..n {
            let current_value = events[i][2];

            // Binary search for the first event that ends before the current event starts
            let end_time = events[i][0] - 1;
            let idx = events.binary_search_by(|event| end_time.cmp(&event[1]))
                .unwrap_or_else(|x| x);

            let total_value = if idx < n { current_value + max_vals[idx] } else { current_value };

            // Update the best value
            best = best.max(total_value);
        }

        best
    }
}