Problem p03038 (python)

Fixed submission:
from heapq import heappush, heappop

# input
N,M =map(int,input().split())
A = [0]*N
B = [0]*M
C = [0]*M

A = list(map(int, input().split()))
A.sort()
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))


def solve():

    pairs = zip(C, B)
    sortedpairs = sorted(pairs, key=lambda x: x[0])
    for i in range(M):
        B[i]=sortedpairs[i][1]
        C[i]=sortedpairs[i][0]

    ansA=[0]*N
    for j in range(N):
        ansA[j] = A[j]

    p = int(0)
    j = int(0)
    while  j<N and M>=1+p :
        jd = int(0)
        if ansA[j] >= C[M - 1 - p]:
            break
        while  B[M-1-p]-jd>0 :
            if j==N : break
            if ansA[j]>=C[M-1-p] :
                break
            else:
                ansA[j]=C[M-1-p]
            jd +=1
            j +=1

        p +=1

    ans = int(0)
    for j in range(N):
        ans += ansA[j]

    print(ans)

solve()

Buggy submission (verdict: Runtime Error):
import heapq
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float('inf')
ans = []

N, M = LI()
A = LI()
BC = [LI() for _ in range(M)]
A = list(map(lambda x: x*(-1), A))
heapq.heapify(A)
BC = sorted(BC, key=lambda x: x[1])[::-1]
#print(BC)
#print(A)
k = int(0)
ansC = int(0)
ansA = heapq.heappop(A)*(-1)
for i in range(N):
    if BC[k][0]==0:
        k +=1
    if k<M and BC[k][1]>ansA:
        ansC = BC[k][1]
        BC[k][0] -=1
    else:
        ansC = ansA
        if A!=[]:
            ansA = heapq.heappop(A)*(-1)
    ans.append(ansC)

#print(ans)
print(sum(ans))

Buggy submission (verdict: Runtime Error):
import heapq
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float('inf')
ans = []

N, M = LI()
A = LI()
BC = [LI() for _ in range(M)]
A = list(map(lambda x: x*(-1), A))
heapq.heapify(A)
BC = sorted(BC, key=lambda x: x[1])[::-1]
#print(BC)
#print(A)
k = int(0)
ansC = int(0)
ansA = heapq.heappop(A)*(-1)
for i in range(N):
    if BC[k][0]==0:
        k +=1
    if BC[k][1]>ansA:
        ansC = BC[k][1]
        BC[k][0] -=1
    else:
        ansC = ansA
        if A!=[]:
            ansA = heapq.heappop(A)*(-1)
    ans.append(ansC)

#print(ans)
print(sum(ans))

Buggy submission (verdict: Runtime Error):
def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

N,M,K = map(int,input().split())

C = comb(N*M-2, K-2)
#print(int(C))

A = int(0)
for d in range(N):
    a = (N-d)*(M**2)

    A += int(d*a)

B = int(0)
for d in range(M):
    b = (M-d)*(N**2)
    B += int(d*b)

ans = int((A+B)*C)
ans = ans%(1000000007)
print(ans)

Buggy submission (verdict: Runtime Error):
from heapq import heappush, heappop

# input
N,M =map(int,input().split())
A = [0]*N
B = [0]*M
C = [0]*M

A = list(map(int, input().split()))
A.sort()
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))


def solve():

    pairs = zip(C, B)
    sortedpairs = sorted(pairs, key=lambda x: x[0])
    for i in range(M):
        B[i]=sortedpairs[i][1]
        C[i]=sortedpairs[i][0]

    ansA=[0]*N
    for j in range(N):
        ansA[j] = A[j]
    p = int(0)
    j = int(0)
    while  j<N :
        jd = int(0)
        while  B[M-1-p]-jd>0 :
            if ansA[j]>=C[M-1-p] :
                break
            ansA[j]=C[M-1-p]
            jd +=1
            j +=1
            if j==N : break
        if ansA[j] >= C[M - 1 - p]:
            break
        p +=1

    ans = int(0)
    for j in range(N):
        ans += ansA[j]

    print(ans)

solve()

Buggy submission (verdict: Runtime Error):
from heapq import heappush, heappop

# input
N,M =map(int,input().split())
A = [0]*N
B = [0]*M
C = [0]*M
ans = int(0)

A = list(map(int, input().split()))
A.sort()
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))


def solve():

    pairs = zip(C, B)
    sortedpairs = sorted(pairs, key=lambda x: x[0])
    for i in range(M):
        B[i]=sortedpairs[i][1]
        C[i]=sortedpairs[i][0]

    ansA=[0]*N
    for j in range(N):
        ansA[j] = A[j]
    p = int(0)
    j = int(0)
    while  j<N :
        jd = int(0)
        while  B[M-1-p]-jd>0 :
            if ansA[j]>=C[M-1-p] :
                break
            ansA[j]=C[M-1-p]
            jd +=1
            j +=1
            if j==N : break
        if ansA[j] >= C[M - 1 - p]:
            break
        p +=1

    for j in range(N):
        ans += ansA[j]

    print(ans)

solve()

Buggy submission (verdict: Runtime Error):
N,M =map(int,input().split())
A = [0]*(N*M*2)
B = [0]*M
C = [0]*M
ans = int(0)

A = list(map(int, input().split()))
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))
    for j in range(B[i]):
        A.append(C[i])

A.sort()

S = int(N)

for i in range(M):
    S +=B[i]

for i in range(S-1,S-N-1,-1):
    ans += A[i]

print(ans)

Buggy submission (verdict: Runtime Error):
N,M =map(int,input().split())
A = [0]*(N*M*1000)
B = [0]*M
C = [0]*M
ans = int(0)

A = list(map(int, input().split()))
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))
    for j in range(B[i]):
        A.append(C[i])

A.sort()

S = int(N)

for i in range(M):
    S +=B[i]

for i in range(S-1,S-N-1,-1):
    ans += A[i]

print(ans)

Buggy submission (verdict: Runtime Error):
N,M =map(int,input().split())
A = [0]*(N*M*1000000)
B = [0]*M
C = [0]*M
ans = int(0)

A = list(map(int, input().split()))
for i in range(M):
    B[i],C[i] = list(map(int,input().split()))
    for j in range(B[i]):
        A.append(C[i])

A.sort()

S = int(N)

for i in range(M):
    S +=B[i]

for i in range(S-1,S-N-1,-1):
    ans += A[i]

print(ans)