HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > CEN110 Practice Exam 2 > problem:


4. 50747 - Safe boxes against thieves

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

Contest problems

• 1. 50986 - The Oldest Person
• 2. 50526 - Gold Market
• 3. 50269 - Matrix Determinant
• 4. 50747 - Safe boxes against th...

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.

Safe boxes against thieves

You work in a gold store. They have several safe boxes. They put the jewelry into these boxes every day. And to protect from the thieves, time to time they change the the items in safe boxes. And so, in a file they store the values of items in each box.

Question: Write a program that is going to read the information for the safe boxes and defines the box which has the most valuable m items.

Input specification
In the beginning, you will be given two integers: number of numbers (n) and top m items to calculate where 1 ≤ (n and m) ≤ 100. Then, in the following n lines you will be given at most 1,000 integers ending with a negative number where each number is between 1 and 1,000,000.

Output specification
Show one number: ID (order) of the first box which has the most valuable m items.

Sample Input I
3 2
7 15 10 10 10 12 12 -2
7 4 10 5 -3
19 15 3 19 -1
Sample Output I
3

Explanation: Total amount of most valuable 2 items:

  • in safe box 1: 27
  • in safe box 2: 17
  • in safe box 3: 38


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

www.contester.ru