小明定了n个闹钟防止上课迟到,每个闹钟时间不同(5 0 代表5点0分闹钟),上课路程花费k分钟(k<100),第一堂课上课时间为T(6 58 代表点58分上课),请找出一个能让小明不迟到的最晚闹钟时间。
输入例子:
3
4 0
5 0
6 0
59
6 59
输出例子:
6 0
def time_trans(s):
return s[0]*60 + s[1]
def get_time(m):
time1=m.strip().split()
for i in range (2):
time1[i]=int(time1[i])
time2=time_trans(time1)
return time2
num_alark_times=int(input('num_alark_times'))
class_time=get_time(input(('class_time')))
wait_time=int(input('k='))
get_up_time=[]
wait_time2=[]
for n in range(num_alark_times):
get_up_time.append(get_time(input(('get_up_time'))))
wait_time1=class_time-get_up_time[n]
wait_time2.append(wait_time1)
a=wait_time2.index(min(wait_time2))
c=int(get_up_time[a]/60)
print(c,':',get_up_time[a]%60)