CT50569

The K-th So Far Beneath Verdigris

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the copper works of Verdigris, someone must recover the missing manifest. This year the task falls to Viktor, armed only with the marks register. 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: 828 613 924729984 -15574550 826230353 -192722017 -230944416 -609575097 766964433 257515350 -819884883 -673944429 928862526 252132508 523722545 105805174 -957258112 568039043 -195763034 -348006269 -415828312 109587285 515787396 650318967 -296160786 -89310651 -943876048 -725022647 -778046222 -597097027 -753461692 -232789568 593864577 -798577744 -746300558 -960546808 395635229 -771184954 217147873 -580991765 -87872054 898724939 -913239548 740383436 -738211648 -389132136 856761964 -831079571 257816939 175384267 971030005 573781411 133930601 -125108730 153789897 142820456 665259271 -733287615 -238148665 92475963 -506392904 487680485 -671886481 -5257332 -870570521 -865125396 795251632 804210754 726369224 953986369 48273970 -662643417 346666004 102948188 944666797 -48932918 957870750 -814405937 -…
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: 2959 62 269141783 918827236 197881210 -446829740 -594664210 44200587 -600927123 919514309 -543516926 -740544997 175656247 -43326336 -136874448 12434604 -957146556 -303923310 -445595449 -955503135 -267222631 -364335780 759810088 590914991 351873575 -276467519 -898219113 163084758 20790048 174493656 -839249120 780277465 -492381677 783442246 -353606703 216741090 818329899 377792895 -455210756 153048001 -606258148 -254438496 512131111 -112861237 -571627502 627078864 -388553829 765701815 21741271 813077264 399170351 700710893 149546093 -855226166 -272261970 704370380 -198016853 33414402 63018303 779478485 811037038 -126778693 712312853 -440637403 644447417 596501095 -456597872 606918347 -871591961 -452925765 -92022786 624504172 -463429675 -495024482 -620072733 613278731 843269522 -103542271 130…
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 -957146556 -955503135 -898219113 -855226166 -839249120 -839249120 -740544997 -606258148 -600927123 -594664210 -571627502 -571627502 -543516926 -495024482 -492381677 -463429675 -463429675 -456597872 -455210756 -455210756 -452925765 -452925765 -446829740 -445595449 -440637403 -388553829 -387555081 -385601442 -364335780 -353606703 -341801406 -303923310 -303923310 -303923310 -276467519 -272261970 -267222631 -267222631 -254438496 -198016853 -198016853 -198016853 -198016853 -198016853 -136874448 -126778693 -126778693 -112861237 -112861237 -112861237 -112861237 -112861237 -112861237 -103542271 -92022786 -89643593 -83…

Example 3:

Input: 742 123 -84433967 -162003612 569038919 -822551926 -782559457 -917256712 -231365586 -88363511 662697889 -820581997 848199173 673325927 -936603341 -663849130 -511569348 -908153382 -431296642 -111606227 771661988 377515883 204205584 325023829 -313711580 919155707 -333728999 183095691 809410749 58034047 -661411842 540940203 -836817869 -888702580 -886393446 -409929906 -574062915 -786980091 872673121 895975479 -533416600 -822427325 576940361 428262048 712484893 -956110164 -17592133 429104195 -387686618 -700111195 -409163322 -988467976 127477546 -995857441 391965349 -562563354 940722772 708761766 -550311723 -929060759 887185215 -452984377 431931723 921461314 -393505834 -762772634 151528892 -473537035 -750662363 -695915910 -417542700 -454526237 -844933692 310631786 646364004 579478161 227998089 33…
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 -995857441 -988467976 -960429583 -956110164 -941546454 -936603341 -929060759 -923681963 -917256712 -908153382 -897306742 -897306742 -891327735 -888702580 -888702580 -886393446 -844933692 -836817869 -822551926 -822427325 -820581997 -794095792 -786980091 -782559457 -762772634 -757248098 -750662363 -749951250 -705469343 -700111195 -700111195 -695915910 -678970880 -663849130 -661411842 -574062915 -567920374 -562563354 -550311723 -5334…

Constraints:

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

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