Submission #28415333

Source Code Expand

n,k = map(int,input().split())
p = list(map(int,input().split()))

num = (n-k)+1
first = p[:k]
first.sort()

import bisect
for i in range(num):
    if i == 0:
        ans = first[0]
    else:
        if ans < p[(k-1)+i]:
            first.pop(0)
            index = bisect.bisect_left(first,p[(k-1)+i])
            first.insert(index,p[(k-1)+i])
            ans = first[0]
    print(ans)

Submission Info

Submission Time
Task D - Prefix K-th Max
User Sirocco110
Language PyPy3 (7.3.0)
Score 0
Code Size 404 Byte
Status TLE
Exec Time 2209 ms
Memory 133836 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 16
TLE × 12
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 62 ms 61832 KiB
001.txt AC 250 ms 133528 KiB
002.txt AC 221 ms 133712 KiB
003.txt TLE 2209 ms 133640 KiB
004.txt TLE 2209 ms 133764 KiB
005.txt TLE 2209 ms 129380 KiB
006.txt AC 208 ms 105412 KiB
007.txt TLE 2209 ms 133660 KiB
008.txt TLE 2208 ms 100300 KiB
009.txt TLE 2208 ms 101988 KiB
010.txt AC 273 ms 133552 KiB
011.txt AC 241 ms 133836 KiB
012.txt AC 150 ms 133640 KiB
013.txt AC 150 ms 133600 KiB
014.txt TLE 2209 ms 133816 KiB
015.txt AC 222 ms 133816 KiB
016.txt TLE 2209 ms 133780 KiB
017.txt AC 228 ms 133708 KiB
018.txt AC 240 ms 133744 KiB
019.txt AC 271 ms 133600 KiB
020.txt AC 166 ms 133812 KiB
021.txt AC 167 ms 133640 KiB
022.txt TLE 2209 ms 133544 KiB
023.txt TLE 2209 ms 133548 KiB
024.txt TLE 2209 ms 133820 KiB
025.txt TLE 2209 ms 133644 KiB
example0.txt AC 62 ms 61980 KiB
example1.txt AC 49 ms 61920 KiB