CT51614

Hans's K-th So Far Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the railway depot of Cinderline as Hans unrolls the day's manifest of marks. The tally will decide the next shipment. 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: 2452 769 -510419627 -776470199 -469028905 -177125406 -551450136 350657047 -68622512 278210419 249888700 270614979 -42734429 -98438134 410597353 229315333 -391749584 773543174 -327200245 325863944 -449939249 244446962 675905196 424563730 223068514 497234171 479834747 654735147 192238726 -731805234 -238251972 -337128963 -162736084 805461861 -142345769 -290063305 -306081052 -986967845 -426913397 -459422898 -143682631 460417373 403155260 -956617930 -788013510 892692570 853072649 -451936895 813373949 824547800 873440017 674831464 -608878108 -761875670 61722050 278009534 -245359935 520140558 -423004983 489392296 -213939525 -102806851 558633064 -387127406 -653422597 -749374845 -803218689 -513511570 -50011074 -757815365 -780987574 -499074417 891909274 -935818896 945146972 221068529 -864225190 -338…
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: 712 162 -788694941 -295457615 846176286 530434849 -831126192 -799321796 744901731 536722405 -386207603 736786240 -236123859 679201111 -357948551 -505715726 -889063307 -661691479 514305564 620188258 -146111290 857660935 890363166 -625387176 488538674 -579324211 87738341 441165164 -516576917 -986276922 639476537 -694696367 -659379788 695164679 710692663 -469430742 -486425017 255250159 596065081 -95157513 571132735 924657812 497358084 356818259 448433955 -201122209 610462449 44650263 -265603043 212731704 -983735661 -888294482 741376471 -815806085 -747983003 -85576676 -850877627 439790148 171134206 350516827 -670300613 656542417 502925246 -77457977 252003067 724593119 -507395559 -338439247 329902713 -990138183 -76720913 834649809 956674543 913600988 -266076398 629167213 -344014338 637108307 36…
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 -999136110 -990138183 -986276922 -983735661 -973111204 -973025547 -968015789 -946999573 -934083077 -919311626 -889063307 -888294482 -877550437 -876206171 -867610525 -850877627 -842250094 -831126192 -820080546 -815806085 -815806085 -799321796 -788694941 -781239686 -771368604 -747983003 -743848312 -725616830 -70190950…

Example 3:

Input: 2331 1904 -549108954 -134530822 -698499671 -328381371 909692029 683202949 133555828 -152919347 -402547629 175837967 -848760317 -660257937 -661463594 -325871867 -101092816 276516638 -628596895 -832006949 -410824791 534623480 839450524 219950962 -130634296 491477575 -438348520 -518377998 -589517576 608989954 -459895659 -947359425 -101180708 466412642 -427580630 -944320949 -303297553 673123890 -635072497 678346086 37073480 521806752 628690390 -574655244 -767355284 -138663823 196981163 -422036799 200526080 -425813106 -787456130 7045881 703208643 -778190209 707949181 -638740365 727097897 60056818 -104985516 -933011273 742878799 -853339410 -671837565 382260576 -20915422 -452440589 372612225 35273624 -267847978 915293824 363082235 -593543947 -255062424 -390358654 -820647035 292104599 -130203404 9…
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.
Hans's K-th So Far Ledger - MEDIUM Coding Problem | CodeTikki