CT38997

The ledgers at Horselord Plains

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Scribe the scribe watches over the steppe camp of Horselord Plains's stores of ledgers. A careful computation stands between order and chaos. 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: 1864 836 450274805 108322102 619010190 -767765927 -864481593 1849479 151957511 -458653861 -136064984 -426839237 250274 374670995 -974572553 492085594 627338523 -265274231 671929662 -867215484 -851091532 -104534273 33794380 -419604919 607217181 135323527 398062316 -651581146 351336959 -746489772 -888630915 -4690723 969198534 968737395 319636698 904748430 36467371 -812140449 687633828 438186013 -71983543 -976358987 905671242 137428920 306591265 98551888 249660004 564837709 -293770761 23162212 788407256 -859359691 323307660 21207862 -255713682 814189870 74340659 -725631879 99584936 299256158 -490638394 -993626904 456084794 633066967 797132879 60532134 -850833791 422661442 278079167 617009289 -755824162 -446455934 -981763595 284533385 -210582683 845374885 845649066 -783278775 860702565 -315799…
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: 2546 370 -393622839 -625203040 -91893282 -352523105 -241914082 -387920560 -703227988 276067827 168318773 -760756983 -137518882 -747767064 -108405835 804182570 559689241 521016860 -297901812 103965017 502335937 -396560031 -306893761 -902546432 567872548 -17953326 -692660453 192522305 -338730892 -854868027 324167980 -220830397 -417778466 580851751 684250338 -662973204 874273361 -744242909 -99866618 -742083590 870525836 308759427 923524080 523519375 100533131 -600630141 296883016 -22797962 -67343518 786249660 895406726 835320815 440090748 621072517 922563416 -579395159 -777398663 984646111 875741418 992082737 -822490772 -205190739 71000475 304649232 762983854 755251538 781107113 -35622211 355344158 -520017961 -683081278 720156166 -816650874 531057509 163197702 -794477845 -279248698 -424921328…
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: 3738 2470 221311930 -216631738 -463015549 -389964694 154056593 -55746822 -998557472 -867283290 -593156589 118237502 562222186 -598151062 26271403 681461587 -133728475 -103613121 132750228 839615641 -978204653 -225734722 443438779 -464675123 240222059 283939929 -192468811 937330102 -731996783 -239049361 843891257 -587875480 240166893 -189706069 -84492053 785388622 132991147 362287393 960031 80266045 -892766809 -856854801 -824820949 812716152 -246041628 -782314946 752975128 -172228800 -146565220 747019073 -136783712 -17530622 422968541 -110910038 -179009056 807805355 430559856 508433840 -313119482 238854323 -997771652 585952997 -990634641 -326070909 -164525939 -585470901 701982520 132520336 755430376 -922879723 -322520740 -266630527 -70264164 -863097070 782750438 342434552 243815521 44731796…
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.
The ledgers at Horselord Plains - MEDIUM Coding Problem | CodeTikki