CT44787

Kabir's K-th So Far Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The assayer Kabir has been asked to track the breeding season. On the desk lies a long table of ledgers 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: 1026 607 254808477 -998936033 -893233766 412647302 629167665 832015185 949458963 -190920193 -928482506 178782013 990134979 102953320 939145242 -114618756 -41472006 533568871 -16796116 -718249284 379151191 236084413 64825917 -738214709 969227235 -902526505 -745812834 204312394 -650113553 -65502299 526451367 370986832 -418332610 -486722896 -162608907 634201031 708134932 -275420554 -971473364 230721131 -123074537 -719673588 -378652456 547029547 -82204903 296892862 -709069909 582256812 -225225884 549655219 -253863563 -242416106 -249652858 -77740004 887151077 -952306700 -481628762 989571404 279369755 181762566 -16480085 78521491 376382892 352828323 931072930 -250624260 -133862340 438512255 593590735 -198002503 -163107619 584524125 656922533 -93209970 56960994 179972865 458335764 948064414 87090…
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: 390 14 157141475 -629785092 -919000953 -530522481 53806898 436360950 -533107197 -870363588 244230250 829860827 52318448 105408541 -542366391 -768590549 965747725 -939176923 695013095 -997758927 -33439817 -97498204 114840964 -220349959 -174849191 -64043403 -888237012 40256935 -690286698 -170606557 693558916 -761743699 282949461 -78534569 611187959 514998733 119484719 -413949360 393760127 -54575746 -61368301 -342281000 548321483 848975811 -557578202 -548291029 -698024007 126753881 381488710 -22606885 666231280 100671943 -777094757 -902308746 -357119598 -557523412 -973079478 265026974 275283423 296050345 -332556074 -456438139 -598603631 243877795 -6997752 -285694955 -665245314 958366982 -364448794 392475722 58673451 -782070993 -857967274 -909715903 361818810 -307569075 361833742 -245443175 97…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -919000953 -870363588 -870363588 -768590549 -768590549 -629785092 -542366391 -533107197 -530522481 -220349959 -174849191 -174849191 -97498204 -97498204 -97498204 -64043403 -64043403 -33439817 -33439817 40256935 52318448 53806898 53806898 105408541 105408541 105408541 105408541 114840964 119484719 119484719 119484719 119484719 126753881 157141475 157141475 244230250 244230250 244230250 244230250 244230250 244230250 244230250 265026974 275283423 282949461 282949461 282949461 282949461 282949461 282949461 282949461 282949461 296050345 296050345 381488710 381488710 381488710 381488710 381488710 381488710 381488710 381488710 381488710 392475722 392475722 392475722 392475722 393760127 436360950 498289204 498289204 498289204 498289204 498289204 498289204 498…

Example 3:

Input: 1848 574 -948401929 -450068714 955906095 -743746541 256269337 220131376 869087871 715981978 316370062 -764784269 -446611143 -476085972 373702530 143891310 -248167927 -55049567 -484841622 848663673 -962677215 903830836 483962628 -681759016 251035017 529920893 -937766304 -22530591 937104342 556535809 694049933 241665989 -287610175 425337000 280432110 925385485 -881591103 -333675875 683033485 792690449 153439376 -261748671 -509016885 -860137152 -383930862 447552628 -771909070 452780044 -7401736 -334104910 -395342711 624651538 -141960761 -193729995 698787164 -644091539 -741152552 198533257 -825975245 -129632742 982333063 -842231516 -473296337 333504873 -399657151 -745500075 -109988096 439781439 -541811230 -936018242 492428587 -552749486 -662237444 -514160931 -288014208 786676555 108630576 -412…
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.
Kabir's K-th So Far Ledger - MEDIUM Coding Problem | CodeTikki