Submission #8896636

---

Source Code Expand

from heapq import *
def main():
    n,m=map(int,input().split())
    a=list(map(int,input().split()))
    h=[[-j,i+1] for i,j in enumerate(a[:m])]
    heapify(h)
    for i in range(m-1,n):
        j,k=heappop(h)
        print(k)
        if i<n-1:
            if a[i+1]>-j:
                heappush(h,[j,k])
            else:
                heappush(h,[-a[i+1],i+2])
main()

Submission Info

Judge Result