CT38935

Faye's Ledger of beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the moonlit lagoon of Selene; Faye weighs the day's beacons manifests and starts the calculations. 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: 1711 1021 81222664 -608803109 -16687046 928943897 -499793114 -13104530 -71439963 859177594 -775532531 866130773 390698440 -492271562 519338514 865103555 524314245 -828375021 157412025 492862070 121922897 718895381 348865009 473497377 -986560691 -721490481 -252087156 -294452755 -604388007 -201405710 629572035 271221637 735514576 538988297 -936446256 768591370 -326803276 -390979560 641116611 -264440336 678922988 -728001479 552987530 890439664 -5381326 -193256923 569229314 826861821 646134655 749509681 -280933265 645305561 311657175 -2269147 653079634 876568159 -962225462 636121028 942568692 499862964 -877086158 175162017 845733817 437838841 -85207181 -316312013 80683034 474227625 -701500999 -293459224 -236306361 365104919 343485429 -431824578 509675477 376395273 -291025475 -153321896 1669695…
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 2:

Input: 766 72 541864138 723563123 -664023601 -63423755 -435772835 -588197495 -111788146 567305937 -998070786 774255344 930569980 609641144 732422761 -637423838 -930081994 -467084943 604261770 -199597551 135259016 -402793193 937047622 -426565769 349935880 -295498211 829180252 -565104063 544184297 632971052 -140963915 -752885883 566187569 73216864 -260032889 290008353 -837713824 226120566 -764667831 -799239333 711209605 373362398 -489224160 916412852 -37907001 465166361 -107578414 -47846561 -47275641 775198606 796150992 -863444365 71876965 51144952 216275557 -92424473 32726833 676916760 126759164 62093984 721550516 537733508 80564326 800471750 -658268550 -921792372 -839696265 -837618198 877876309 -787148687 208081411 -476445251 -485114779 -269266417 532449390 836292746 -759410426 792024025 22517260…
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 -998070786 -930081994 -921792372 -863444365 -839696265 -837713824 -837618198 -799239333 -787148687 -764667831 -759410426 -759410426 -752885883 -664023601 -658268550 -658268550 -648279492 -637423838 -588197495 -565104063 -565104063 -501368064 -489224160 -485114779 -476445251 -467084943 -467084943 -435772835 -435772835 -426565769 -409471553 -402793193 -295498211 -269266417 -260032889 -229365445 -229365445 -212718982 -199597551 -199597551 -151866125 -151866125 -151866125 -151866125 -151866125 -151866125 -151866125 -151866125 -140963915 -140963915 -140963915 -140963915 -140963915 -111…

Example 3:

Input: 3996 2515 370952605 -396568259 93620694 -52604087 -350065200 -501650918 -746506732 856082534 642463135 -329438879 -897965008 -884781849 -369499433 851919252 -801021274 -623339016 217833554 -106689827 -878230645 -196637244 -650052516 -236884530 -443145286 431129681 108522785 -236985168 -284257135 624677703 685077652 395638352 -703970006 -405597221 387118470 474528829 -940101502 895430715 -133409485 667576999 163162617 -586570568 -124432136 -975788456 193716196 844081361 792051924 -120631994 458017612 247176624 -160991340 -435740414 744555845 435141470 -85268031 -968512074 233115558 38032144 -320287894 -641068230 947618714 -642924298 -9217684 962832762 -212864217 993597259 692733386 -186085732 211564690 -858814585 -396405608 -506363585 849630270 183912640 15134275 -817961266 429553826 318432…
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.
Faye's Ledger of beacons - MEDIUM Coding Problem | CodeTikki