CT47312

Leon's Peculiar Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the shipyard of Keelwind, Leon the clerk keeps careful count of the registers. Document the rare sighting, every figure matters. 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: 3359 3016 -823606727 -990247599 937195178 962529973 169624857 494785866 442913031 -43658643 950178988 470687390 445519017 440447309 -480578535 -596203820 813379762 -680904117 -517593740 757179808 -250412182 878595414 537460714 -364629448 -278742368 -403067882 661564211 174764736 63452426 888901045 -145115257 801227441 115229550 -258298832 1525057 -111320922 596789227 -533582000 -598602042 -644038804 -238855639 -113443672 -88202633 768914002 -596350838 -852602754 306574563 827708830 -81718445 577423341 -61742527 -542185536 -418027296 -989326274 -4735558 -121745013 601985874 105112663 -110572582 777976102 -919763243 153082870 -878851583 482000107 790903826 -989392171 -910077583 -702944611 -779081190 -666094852 -799522975 743874442 -866644510 -820848298 -526081783 -775344401 120890533 -467324…
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: 862 710 276605062 -912438608 -837609247 -421742189 -916709517 648118089 -691141366 -76180555 353061853 188845219 -924439480 476796866 -912093674 245104812 -697949708 -138063972 -159013886 840098828 -779122363 -491310279 954809737 390679502 -115721532 -611310537 -595378466 -150858341 882686322 715161876 876530860 12296784 -314939256 842448328 435229006 72791247 -595255296 -203242803 313650798 284703019 761804485 728063584 -282914356 -194444857 451581688 667716836 -755134655 -750133060 -350090580 -834731440 -861698081 210024349 -838408607 -527328721 268095260 -479987883 -308181711 140018126 108296097 115718432 414872091 -293594852 746369726 333230769 -253223674 -511151249 546586829 -588421826 -230016391 -629498376 -157328568 -280230391 312871615 -621111030 -256051389 206043152 882397282 7517…
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: 982 668 345061596 -741767249 -958068013 -666947239 -927014072 449521961 80274934 -124685534 -820252390 -857745839 550099148 231360340 -42737430 -21913205 744939441 -233470284 373210846 -77568058 -813800362 -6134738 64314976 -687166238 -901937118 112691238 -4721269 -982141181 309005336 -771749571 26284711 -686074211 962468509 -162610990 270158508 87546899 256602398 -247820847 81537111 -506366602 224635589 -384863296 -145317191 -266059783 -17337942 -871528737 -97402272 817131292 91951557 727741777 -303816466 398201831 -504974103 833708001 -266055861 88062601 766366728 -138212772 -394864386 -786661009 -268329744 -918653082 507971775 352263412 34610497 -881735072 604437169 -34045041 33720278 48993558 -653739492 -279988128 438058817 -160169045 539735217 491444614 604167742 -987203505 -876387728…
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.
Leon's Peculiar Ledger - MEDIUM Coding Problem | CodeTikki