CEN110 Practice Exam 2 |
Start: June.01.2017 at 09:08:00 AM
Finish: June.01.2017 at 10:05:00 AM
The contest is finished!
• Contest scoreboard
|
Feedback | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Question by Ibrahim Mesecan.
The Oldest Person
Question:
For the history lesson, your sister has to find some people
and then, she has to identify also the oldest person.
Write a program that reads birth and death dates
of n people, and then, it calculates the oldest m people.
If two people have lived the same number of years,
then check and compare according to the months and days.
If they have also the same number of days and months,
list the person whose id is smaller. Note:
Assume that there is no date before 1-1-1900
Input specification:
You will be given two integers in the beginning:
the number of people (n) and the number of people to show
where 0 ≤ m ≤ n ≤ 10,000.
In the following n lines, you will be given
two dates information (day-month-year):
birth and death dates of people.
Assume that there are 30 days in every month. And,
there are 360 days in every year.
Output specification:
Show IDs of m oldest people
where IDs are from 1 to n (order of appearance).
Sample Input I
4 2
5-12-2004 5-12-2006
5-12-1976 5-12-1986
5-12-1945 5-12-1985
5-12-1974 5-4-1975
|
Sample Output I
3 2
|
Для отправки решений необходимо выполнить вход.
|