HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Data Structures > problem:


50447 - Swimming Contest - 2

Guest
• Review clarifications (2)

Volume problems

• 50490 - Across the River
• 50837 - Sum is equal to K
• 51010 - Max Sequential Sum
• 50772 - The Path of a Node
• 50936 - Saving the Soldiers
• 51086 - Top popular student
• 51015 - Student Scholarships
• 50828 - Arranging Time Table
• 50447 - Swimming Contest - 2
• 51072 - Castle on chessboard
• 51082 - Sum is equal to K - 1
• 50794 - Writing Files Into HDD
• 51020 - Number of nodes removed
• 51023 - Preparing Keyword Index
• 50929 - Present from your uncles
• 51075 - Shortest Path for Bishop
• 50863 - Total Access Cost of a BST

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.

Swimming Contest - 2

In swimming contests, the swimmers jump/fall into water from platforms of different heights while performing acrobatics. They are evaluated by many judges. Every judge gives a point between 0 and 10. When calculating the average of the swimmer, usually two of the evaluations (Max and min) are discarded and the average is calculated out of the rest of the judges. But this year, the organization committee has decided to discard the middle grade. There will be 5 juries, and you are asked to calculate the average grade by discarding the middle grade.

Question: Write a program that is going to read swimming information for n swimmers. Then, your program should calculate and show the top m medalists.

Input specification
You will be given two integers in the first line: n, the number of people and m: the number of top swimmers to show where 1 ≤ m ≤ n &le 10,000. Then, in the following n lines you will have the information for swimmers. In every line, first you will be given the name of swimmer and that is followed by 5 points given by the judges. The names contain at most 15 (only 26 English) letters and no special characters or space.

Output specification
Show the name of top m swimmers. If there are several swimmers with the same average, show the people in ascending name order.

Sample Input I
3 2
Shaun 8.4 5.6 7.2 9.2 8.1
George 5.4 8.7 6 9.9 7.6
Kim 7.5 5.2 5.9 9.1 8.5
Sample Output I
Shaun
George

When the middle grades are discarded the swimmers have the following averages:

  1. Shaun: 7.6
  2. George: 7.5
  3. Kim: 7.175


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

www.contester.ru