LKP '18 Contest 2 P1 - Food Lines - DMOJ: Modern Online Judge

LKP '18 Contest 2 P1 - Food Lines

View as PDF

Submit solution

All submissions

Best submissions

Points: 3

Time limit: 3.0s

Memory limit: 64M

Author:

KevinWan

Problem type

After many years of continuous warfare, the country of Collea was left in shambles. This has caused food shortages and famines all across the country. In an attempt to distribute the little food that was produced and prevent food hoarding, the Collean government limited the amount of food that any one person can buy. Soon, Collean citizens are forced to wait in long lines in order to obtain the food they needed. There are currently $N$ ~N~ such food lines in the city of Lachtin, the $i$ ~i~th of which has $a_i$ ~a_i~ people in it. $M$ ~M~ people are going to enter one of the lines in the next hour, where they each enter the shortest line they see. Since Phreia plans to enter the line, she wants to know the length of the line that each person decides to join.

Constraints

$1 \le N \le 100$ ~1 \le N \le 100~
$1 \le a_i \le 100$ ~1 \le a_i \le 100~ for $i$ ~i~ in $1, 2, \dots, N$ ~1, 2, \dots, N~
$1 \le M \le 100$ ~1 \le M \le 100~

Input Specification

The first line contains two positive integers, $N$ ~N~ and $M$ ~M~.
The second line contains $N$ ~N~ positive integers, $a_1, a_2, \dots, a_N$ ~a_1, a_2, \dots, a_N~.

Output Specification

Print $M$ ~M~ lines, the $i$ ~i~th of which being the length of the line that the $i$ ~i~th person joined.

Sample Input

5 3
2 2 3 3 3

Sample Output

2
2
3

Comments

-1

GopiKota commented on Aug. 13, 2022, 3:06 p.m.

the second line in input indicates the number of people in each line. Thx.

-5

marmartins commented on Oct. 11, 2021, 6:28 a.m.

The problem input is not so clear when compared to the problem explanation.

This comment is hidden due to too much negative feedback. Show it anyway.

-1
slam commented on May 30, 2021, 4:01 p.m.
Solution:

Create a helper function for calculating the shortest line using a simple for-loop.

Loop over the number of new people m. Find the shortest line. Print it. Then, increment that short line.