ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Object Oriented Programming > задача:


50986 - The Oldest Person

Гость
• Вопросы к жюри (2)

Задачи сборника

• 50339 - The Largest Rectangle
• 50345 - Orders
• 50346 - The Biggest Date
• 50992 - Top K Obese Classes
• 50991 - Intersecting Circles
• 50989 - Rectangles and Points
• 50984 - Top m hardworking employees
• 50269 - Matrix Determinant
• 50986 - The Oldest Person
• 130. 50326 - Matrix Operations
• 170. 50327 - Parallel Lines
• 180. 50325 - How much time passed?

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
CEN112 2016 Questions 15-PE2-7.

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



Для отправки решений необходимо выполнить вход.

www.contester.ru