CT54254

Cobbler Counts the beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The chronicler Cobbler has been asked to compute the guild dues owed. On the desk lies a long table of beacons readings. Task: As values arrive one by one, after each arrival print the k-th largest seen so far, or -1 while fewer than k values exist. Input format: First line: n and k. Second line: n integers. Output format: Print n answers space-separated. Constraints: 1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Example 1:

Input: 203 48 430947805 -692145668 275891873 978952287 -336873994 -668852328 -441709622 543296848 283339209 940476421 70505075 746846933 -588257119 -126310018 -300741583 -841243168 -570005073 -423691274 -558686178 -540327057 134557458 -873033844 -813218314 -121145231 245165396 -102428094 -290955200 -992547758 969390523 -180036676 -302586148 57026002 431038047 599046392 261977362 -811078470 334428179 -593922446 116657310 -6487913 -434742241 792636520 -446669892 -461107659 496633261 299409002 -657331240 193381746 840048007 998274823 -340662747 -708283558 -773910808 398211322 -82392877 -414522434 929755152 961731946 619997003 132656354 416263451 -129614182 880808228 49035576 -87545981 272780833 -576382674 -960425597 391324136 -374054257 411482131 -118533103 -443185382 609074124 -365596603 447753121 …
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -992547758 -873033844 -841243168 -813218314 -811078470 -773910808 -708283558 -692145668 -668852328 -657331240 -593922446 -588257119 -570005073 -558686178 -540327057 -461107659 -446669892 -441709622 -434742241 -434742241 -434742241 -423691274 -414522434 -374054257 -340662747 -340662747 -336873994 -336873994 -302586148 -302586148 -300741583 -290955200 -234274125 -180036676 -180036676 -180036676 -180036676 -129614182 -126310018 -126310018 -121145231 -118612232 -118533103 -102428094 -87545981 -87545981 -87545981 -82392877 -6487913 -6487913 -930271 -930271 49035576 57026002 57026002 57026002 70505075 70505075 70505075 116657310 132656354 132656354 13455745…

Example 2:

Input: 2409 796 90023834 -79813252 -951405446 -910275098 620407421 946514763 91957882 -684486692 -181880570 441668076 -952383351 398863164 -31910717 -299598634 874883489 15031137 113911821 -544628587 589709756 -714118063 275960533 832589969 -520366884 -625300787 -147051787 388364562 -515374972 529088394 -758182024 -959962559 66475092 -776952980 59446636 -534498353 -821804763 -726972935 -310974318 -531936738 170944728 693985857 -914109745 377730468 -400447471 -40674097 623811521 -604421094 -893160039 978612750 945490516 -367146835 985252585 -144815089 -966149101 -110718246 -582913109 215575020 -426755178 596758127 -4662292 670749273 301586698 -569776395 -904117807 505586822 -122807143 675007467 260453322 315205338 672832377 302233437 932169826 -930853769 -668974496 790184042 -369753946 -615997023 …
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1…

Example 3:

Input: 906 895 -957499352 234295585 -768335317 832597108 -970633678 842641242 -119025610 360837410 -646722696 319893844 146882113 9418133 -375365911 360712902 299883307 -104595763 -167768830 -533085537 -673057962 -505026428 -419176248 907403206 526808835 795554936 -89684074 -406419684 225384953 -900865352 938477820 -970276170 -345651423 -104428466 816110716 877862229 777427686 -262296127 778292395 -821990777 63924648 480052744 -861614797 734130312 -616878592 274940994 -8740301 544681819 11104969 82464280 904588027 360440536 -77239404 458584204 -119981583 344712312 978475380 549648825 868702143 -423296421 222431042 -172164711 350519491 -745079478 -697283400 314303804 550042227 -347993725 -36497719 538005370 -714364287 -546263658 -342579246 -45483014 -639865793 50873114 -474488794 -244968468 204444…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1…

Constraints:

1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.
Cobbler Counts the beacons - MEDIUM Coding Problem | CodeTikki