Noisy Mornings
A group of computer
science teacher having a professional development program in Ankara. They are
accommodated in a luxury dormitory. The weather is perfect, the food is
delicious, participants are enthusiastic, and instructors are polite and expert
in their fields. Everything is fine except the noisy mornings. The program
starts at nine o’clock in the morning. Thus, every teacher sets his alarm clock
for a certain time between 08:00 and 08:55. It is possible to set the alarm and
snooze time-out periods in the alarm clocks (or mobile phones). Some teachers
wake up as soon as the alarm starts, however; some teachers listen to the alarm
melody as a lullaby and continue sleeping. Make a program to find the loudest noise
volume in the morning at the dormitory. Every teacher stops the alarm clock immediately
after he wakes up.
Input
The first line of the input contains a single
integer N (1 <= N <= 100) that is the number of the teachers. Each of the
following N lines describes a teacher
with several space-separated entries: Alarm start time, alarm time period, snooze time-out period,
noice volume, and the time the teacher wakes up.
Output
Print the maximum noice volume in the mornign
at the dormitory between 08:00 o’clock and 09:00 o’clock (both included). The
total noise volume of some alarms is the sum of their volumes.
Sample Input1
3
08:00 5 6 10 08:20
08:04 3 1 3 08:10
08:07 2 10 8 08:10
Sample Output1
13
Sample Input2
4
08:00 5 6 10 08:13
08:10 10 10 20 08:15
08:05 5 3 5 08:45
08:14 2 4 8 08:33
Sample Output2
35