CT44208

Farmer's beacons K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Before the gates of the cinnabar mines of Vermilion close for winter, Farmer must finish the beacons ledger - one figure at a time. 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: 2403 2252 -215140071 985640037 -541584112 -399559015 443617572 -776324511 -593505507 -354545941 -263180549 -88951912 126345651 752652533 -36108856 694698280 315680342 -247681694 -474224053 133958948 -946803457 -60116923 248216542 -736359882 -231514109 574239771 203141731 266433868 599850393 -857222120 -994526494 -182198408 479816293 -64825560 196831106 -619616304 -191184866 -169631408 945018246 32626418 400752833 -547646746 548693215 -202111865 411557250 -799183453 519476135 -633104770 387590452 -445709553 517402224 462376604 -566117878 -575662695 -213972057 56707747 81527219 15191983 124837331 708949578 749967097 -694396404 287717645 -623243578 809567577 -929522225 -235035259 574960158 957885035 -152148999 932457525 269428510 -414010655 -827752136 -650671153 -789026266 897541002 716727433…
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: 142 113 -24525079 315401908 355556632 577675856 891707906 358954581 -262764705 179813147 -785927009 362222070 483365924 411736226 399062478 -86159534 299497618 492032261 519970253 -212181253 -772251902 -831813151 -430402127 -916332289 -839415582 628579482 -405218728 -349070159 274711099 905874257 -622518101 -860594496 -94892167 -779792067 45152182 120817535 -117437138 -33740286 876547043 861594632 -592554509 -2404603 731619949 986271311 162779481 -629189728 -982286578 534360950 -53796310 -668591310 233496400 405001266 -195797773 46900358 407435082 608005984 -10247158 -897264718 258210886 633938285 789044875 934067602 841354071 -71723019 -938827024 -313790299 149647377 344924044 -960617314 332631516 -617210507 317142987 -625562734 721660207 156616583 -614140887 404997967 102742016 -46859730…
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 -982286578 -960617314 -949232806 -938827024 -932312854 -916332289 -897264718 -878220949 -860594496 -849089217 -839415582 -839415582 -836541581 -831813151 -823586727 -785927009 -779792067 -772251902 -749302311 -737541197 -728087508 -709758836 -709758836 -693258301 -692281099 -692281099 -668591310 -651653326 -629189728 -625562734

Example 3:

Input: 173 25 -684842357 -253823564 539813140 -469639628 853776002 -890938291 -198567818 456494219 -967889644 -524701363 -192627922 358597056 265728176 850188217 641005381 63615345 -114282042 -712623970 -20628197 221089588 -306838309 -432910787 -208455734 942592421 -103857623 -770525229 -415556840 -557381395 902295954 838545398 251899268 -441226779 465685306 -466778326 -353309642 372615684 558697213 620668486 519460895 658491246 286451894 306815881 453252895 -69493492 757036684 -815222165 -366241430 -437185659 -665126671 67351309 156643299 -516166156 891408698 351424801 -864977149 -154871853 -395515953 -732540982 15800153 839862393 -154827371 -27830040 -889744891 -984109313 -965226634 924515456 296537095 270826537 -10910325 -704670329 488847658 741592919 461002058 -782329518 -677393911 121977996 …
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 -967889644 -890938291 -770525229 -712623970 -684842357 -557381395 -524701363 -469639628 -441226779 -441226779 -432910787 -415556840 -353309642 -306838309 -253823564 -208455734 -198567818 -192627922 -114282042 -103857623 -69493492 -69493492 -69493492 -69493492 -69493492 -20628197 63615345 63615345 67351309 156643299 156643299 156643299 156643299 156643299 156643299 221089588 221089588 221089588 221089588 221089588 221089588 251899268 265728176 270826537 270826537 270826537 286451894 296537095 306815881 306815881 306815881 306815881 306815881 306815881 306815881 306815881 306815881 306815881 351424801 351424801 351424801 351424801 358597056 372615684 435257281 435257281 453252895 456494219 461002058 461002058 465685306 4…

Constraints:

1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.