CT47793

Harper's Ledger of registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The surveyor Harper has been asked to audit the season's records. On the desk lies a long table of registers 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: 1539 1146 356051687 401862754 559019718 735452181 -724945827 500094550 -795317370 -33664237 47749952 281070609 685242267 -184431202 554282194 626225865 94624419 794730890 -265946510 -999966299 -390342582 172046319 -7425386 -139202569 -587732587 -589512673 148418097 -312597124 386636583 -480083326 55180240 -747544172 152908030 -105495030 -454275886 867688024 -323563318 -839403584 364902758 901876244 -415667839 878826499 200068708 251354813 -521945770 -986459209 630741432 293764545 924922470 129437972 -354067076 -549743726 75061881 970637197 615650339 -487876432 659449998 -488323539 -776758905 -238805192 -238240927 617304587 42177076 632061556 -808372237 769321618 -153180345 633416912 -469768652 319104523 497974924 -183654152 -444200462 441638685 -755203969 -702337071 -509335543 -335808662 -…
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: 2202 27 -263073261 438697905 -592301010 630300553 425714626 -276228699 -484732347 -548261621 48431753 -481292012 956925960 602529764 -550303961 721781675 373131733 145000410 -534639415 -693218302 -702396211 -288450664 -300477706 -538103172 -315722698 -869931281 803967611 -733696831 -244768251 -348390057 532537213 96517972 -535718958 876855591 805570640 452011551 -876241894 840155830 -289818132 -615404052 -683321381 -674805324 -479651169 244440581 56126720 87815699 -520979639 -267428128 -735445006 -720703216 767891953 974678944 892250460 -855884873 928875140 -954338466 936500029 944366553 -190959966 -738486970 -195005813 268679023 -532175934 -903275989 296428379 -34171798 620776557 617197857 899604199 942097483 119780166 717298608 -797160331 -760457918 -341354149 -418238707 -989233383 -5925…
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 -869931281 -733696831 -702396211 -693218302 -592301010 -550303961 -548261621 -538103172 -538103172 -535718958 -534639415 -534639415 -534639415 -534639415 -484732347 -481292012 -479651169 -348390057 -348390057 -315722698 -315722698 -315722698 -300477706 -289818132 -288450664 -288450664 -276228699 -276228699 -267428128 -263073261 -244768251 -244768251 -195005813 -190959966 -190959966 -190959966 48431753 48431753 56126720 87815699 96517972 145000410 145000410 244440581 244440581 244440581 244440581 244440581 244440581 244440581 244440581 268679023 268679023 296428379 296428379 373131733 373131733 373131733 373131733 373131733 425714626 425714626 425714626 425714626 438697905 438697905 438697905 438697905 438697905 4…

Example 3:

Input: 3721 3382 708575973 635916000 -280134381 810756954 116788380 -59359548 713597624 799046272 198360850 433062396 795778414 443540485 -167762930 91324364 416445570 -130994414 282144266 923626405 -293625440 167834890 -783495209 -113441310 -622714455 877263794 -36098840 -664307986 520426941 579854681 -70461298 -698136585 -975455262 -220122558 -191083069 834901802 712264172 -27633639 60364085 154442173 -941869837 -610698911 388506205 395860672 455154647 375378389 169791085 -101438335 785019062 499930666 652062209 -103931103 -523377088 335719655 327695177 -249323641 -944753614 -435780545 389972016 -697496434 -543254725 -640817130 -298475985 435478363 -158463226 1920974 -415487223 62525825 -602262224 28165142 254072889 -620340948 -984043521 -6431393 999686040 750677671 303208248 81462397 -89584693…
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.
Harper's Ledger of registers - MEDIUM Coding Problem | CodeTikki