CT35669

Petr's Scarlet signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The clerk Petr has been asked to map a faster supply route. On the desk lies a long table of signals readings. 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: 172 90 -379355619 637302727 129164372 420208792 978489575 -157106095 777940057 -654093109 613004962 -840049654 -558629079 436000103 -285843410 -614881145 -462716799 24832541 510017210 -893724430 373455384 559181819 12826074 324908345 -417490691 -592543641 -789370956 415899651 556669399 43024958 800303115 678022209 -907611547 131742839 300418520 -635599521 855983256 -153624 -247632295 -483848754 515018543 826476167 -864440937 -725749099 -156645492 -852657529 727299040 412529268 265325834 -769325047 323724507 62795200 538249829 -676061586 788640940 -434703771 -502171220 -580641193 -871332167 387253465 -507160325 -621438949 -309324099 -241815018 -852151278 887283385 -51237630 -461094565 445249273 802833318 851712437 -186736502 -960695 332202397 -687328959 235511802 -493751449 -858478067 -5063…
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 -907611547 -893724430 -871332167 -864440937 -858478067 -855566136 -852657529 -852151278 -840049654 -797766002 -789370956 -769325047 -725749099 -687328959 -687328959 -676061586 -654093109 -639301475 -639301475 -635599521 -622261335 -621438949 -614881145 -592543641 -580641193 -558629079 -507160325 -502171220 -493751449 -483848754 -483848754 -476272363 -464048593 -464048593 -462716799 -461094565 -456283826 -456283826 -434703771 -417490691 -417490691 -395148128 -395148128 -395148128 -379355619 -366836891 -366836891 -366836891 -3093…

Example 2:

Input: 3360 40 -321825205 226568371 -120507837 802796795 860943596 -472811954 -497879367 -147283728 -971094841 -231577902 273222205 486397076 -459447291 789253342 649481393 -775090540 -772938345 914775500 -144053180 -477524707 955076481 450348017 -327525864 863619248 -312038160 713950541 -768098025 -772701490 -442794186 -937551005 969180312 -372797984 383562219 -358247152 -718334684 -887626532 563471268 -87697299 -348606016 963656720 -991337049 717717614 330179502 608760533 428736922 106238372 -221643298 -549194458 -806432514 326431953 -841743441 86270415 -619310416 -385407814 837357370 194879948 229385892 -337843082 -412892322 -655079444 302580487 284553367 -654881608 495430408 559774877 580623484 -468199824 -433356662 -474875868 -743980712 -623272160 -117672928 -317731225 -728023153 942546464 -…
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 -971094841 -971094841 -937551005 -887626532 -775090540 -772938345 -772701490 -768098025 -718334684 -718334684 -549194458 -549194458 -497879367 -497879367 -477524707 -472811954 -459447291 -442794186 -385407814 -385407814 -385407814 -372797984 -358247152 -358247152 -348606016 -337843082 -327525864 -327525864 -327525864 -327525864 -327525864 -327525864 -321825205 -317731225 -317731225 -312038160 -231577902 -221643298 -221643298 -167556566 -147652921 -147283728 -147283728 -144053180 -120507837 -117672928 -87697299 -19628891 -19628891 -19628891 -19628891 -9030259 -9030259 -9030259 -9030259 -9030259 -9030259 -9030259 -9030259 86270415 86270415 95223974 95223974 95223974 95223974 9…

Example 3:

Input: 1037 349 -704791477 -177136684 -25370881 23287172 909069787 -675094721 -366240799 125689187 -317461920 520115016 -102342724 890318047 -501928742 -751937899 -419112043 160614760 382307366 -15944102 582265264 456150144 -389442703 930663824 -727437195 -175441962 938705703 -336030996 17197916 -188418696 526705211 735850535 769037770 -84378028 -972492355 -441423912 624415289 -611130827 113574707 -431926362 801953610 298356233 -10362196 774069833 680583143 608044101 -794052627 -889609206 -102910687 -933885042 635899797 -285616890 968880796 461322844 646485540 -477733480 913337971 871095765 -399640722 -833502634 631560989 533806732 -525150791 -236113546 -560660345 324344933 941929291 800905158 -798714371 480100213 222945113 779563193 -61022655 -128869560 4299991 -328893599 -10453619 460732291 765…
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.