题解 | 牛牛的闹钟

n = int(input())
alarms = []
for _ in range(n):
    h, m = map(int, input().split())
    alarms.append(h * 60 + m)  # 转换为分钟

x = int(input())
a, b = map(int, input().split())
class_time = a * 60 + b  # 上课时间转换为分钟

latest_wakeup = class_time - x  # 最晚必须起床时间（分钟）

valid_alarms = [t for t in alarms if t <= latest_wakeup]
best_alarm = max(valid_alarms)  # 最晚的有效闹钟

# 转换回小时和分钟
best_h = best_alarm // 60
best_m = best_alarm % 60

print(best_h, best_m)