CT39517

The Jade beacons of Iris

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the mining town of Ironvein pays by the answer, and Iris intends to earn it. First: the full register of beacons. 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: 1508 385 955044753 44788194 -318971611 -54634082 818635003 -310107534 -130239721 -727598371 466167126 873692888 -603757757 257358961 -580389413 62112588 -581424099 513286297 4364646 -378361185 323325758 -275610584 190655155 420125366 810144214 -700180091 979413999 514201162 -531389112 -576886171 131281306 -669819972 -213917287 -303065539 -995073780 855109610 -410644906 955921994 37926474 622243911 735818865 -12281346 646650456 -250517985 666169726 758648502 724291547 -114731789 920390342 -899282771 -858167333 -449062617 644079762 710554372 958965650 -214733317 -352000621 775081572 -477159319 -258548090 528829005 677421972 625304206 752111296 -496754642 213770159 -186297736 -880280643 168095548 619605772 -52340054 931768083 724783200 -191894954 -463382629 480791381 831969525 739236840 56543…
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: 47 27 -900363673 -868016799 822238024 729221817 870913442 756771564 -32280550 473172985 -445459318 76988845 -3239238 444440942 -432377834 -798737297 703495270 504142320 -190442864 119365078 343730400 -825924472 -896647462 522423986 -255925466 700102793 59861028 355017306 917081669 350451755 -289621541 -17193115 -889406648 782193774 470299139 -67222365 241274913 -581455008 -454103681 64540324 222198320 -23365766 -727306709 -573666254 275474188 -481310925 -748785930 -195958104 951642526
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 -900363673 -896647462 -868016799 -825924472 -825924472 -798737297 -445459318 -432377834 -289621541 -289621541 -289621541 -255925466 -190442864 -67222365 -67222365 -67222365 -32280550 -32280550 -32280550 -32280550 -23365766

Example 3:

Input: 996 417 72663498 350787361 121396000 973526856 962892634 -706926989 443364383 -717026979 965658615 481818774 -601768828 -330250534 -291879962 -870626902 -754799134 709649223 -654490931 -6011805 -176973149 909571863 -225981431 885765123 -908564855 -854048845 509363620 -817030964 253930979 179740077 792338083 689828240 -327267344 -354486 -223533162 -235141213 558899243 -259441566 393152008 -128827738 887250247 549839160 903209432 -396301666 504274812 452401562 838515362 680435702 -148657915 -855296833 -316077706 -744042436 -305532874 -965975110 -721383529 -494685816 -557439842 296763094 295557202 11681894 -955534271 844917653 356434763 64262360 901306655 842499356 -428625553 10678845 135314417 -530056623 664477236 -818149377 -475315946 946660574 145030685 361557122 572681538 477910502 800082…
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.