All Placement Exams Help Available

import sys

MOD = 1000000007

def getMaximumValue(N, D, a, Q, ops):
    ans=0
    for o in ops:
        if o[0]==1:
            a[o[1]]=o[2]
        else:
            L,R,K,T=o[1],o[2],o[3],o[4]
            b=[(a[i],i) for i in range(L,R+1)]
            b.sort(reverse=True)
            used=[0]*N
            c=0
            for v,i in b:
                if c==K: break
                if used[i]: continue
                ans=(ans+(v*19 if v>=T else v))%MOD
                c+=1
                for j in range(max(0,i-D+1),min(N,i+D)):
                    used[j]=1
    return ans

def main():
    data=sys.stdin.read().split()
    i=0
    N=int(data[i]); i+=1
    D=int(data[i]); i+=1
    a=[]
    for _ in range(N):
        a.append(int(data[i])); i+=1
    Q=int(data[i]); i+=1
    ops=[]
    for _ in range(Q):
        ops.append(list(map(int,data[i:i+5])))
        i+=5
    print(getMaximumValue(N,D,a,Q,ops))

if __name__=="__main__":
    main()

Cognizant Technical SLOTS are Available 🎯