input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
n,m = Is()
a = Is()
for i in range(m):
b,c = Is()
a += [c]*b
a = sorted(a,reverse=True)
print((sum(a[:n]))) | import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(input())
n,m = Is()
a = Is()
d = collections.defaultdict(int)
for e in a:
d[e] += 1
for i in range(m):
b,c = Is()
d[c] += b
a = sorted(list(d.items()),reverse=True)
ans = 0
for e,f in a:
if n <= f:
ans += e*n
break
else:
n -= f
ans += e*f
print(ans)
| p03038 |
import bisect
n, m = list(map(int, input().split() ))
values = list(map(int, input().split() ))
values.sort()
for i in range(m):
max_card, num = list(map(int, input().split() ))
num_small = bisect.bisect(values, num)
num_to_change = min(max_card, num_small)
# sort
# values = values[num_to_change:num_small] + [num]*num_to_change + values[num_small:]
del values[:num_to_change]
values[num_small - num_to_change : num_small - num_to_change] = [num]*num_to_change
print((sum(values))) | from operator import itemgetter
n, m = list(map(int, input().split() ))
values = list(map(int, input().split() ))
values.sort()
card_change = [list(map(int, input().split() )) for _ in range(m)]
card_change.sort(key = itemgetter(1))
# 変更後の数をkeyとしてソート
# X枚書き換えるとして、Xを全探索する方針で書いてみる
now = sum(values)
ans = sum(values)
idx = m - 1
for x in range(n):
now -= values[x]
card_change[idx][0] -= 1 # 変更可能枚数
now += card_change[idx][1] # 変更後の値
if now > ans:
ans = now
if card_change[idx][0] == 0:
idx -= 1
if idx < 0:
break
print(ans)
| p03038 |
n,m=list(map(int,input().split()))
arr=list(map(int,input().split()))
arr=sorted(arr)
q=[list(map(int,input().split())) for _ in range(m)]
q=sorted(q,reverse=True,key=lambda x:x[0])
q=sorted(q,reverse=True,key=lambda x:x[1])
pos=0
for i in range(n):
if arr[i]<=q[pos][1]:
arr[i]=q[pos][1]
q[pos][0]-=1
if q[pos][0]==0:
pos+=1
if pos==m:
break
print((sum(arr))) | n,m=list(map(int,input().split()))
ans=list(map(int,input().split()))
arr=[list(map(int,input().split())) for _ in range(m)]
arr=sorted(arr,reverse=True,key=lambda x:x[1])
tmp=0
for cnt,val in arr:
ans+=[val]*cnt
tmp+=cnt
if tmp>=n:
break
ans=sorted(ans,reverse=True)
print((sum(ans[:n]))) | p03038 |
#!/usr/bin/env python3
import sys
import heapq
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
h = []
[heapq.heappush(h,-c) for b,c in zip(B, C) for b_ in range(b)]
[heapq.heappush(h,-a) for a in A]
k = [heapq.heappop(h) for _ in range(N)]
print((sum(k)*-1))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
bc = [c for b,c in zip(B, C) for b_ in range(b)]
# print(A+bc)
k = sorted(A+bc)[-N:]
print((sum(k)))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| p03038 |
#!/usr/bin/env python3
import sys
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
bc = [c for b,c in zip(B, C) for b_ in range(b)]
# print(A+bc)
k = sorted(A+bc)[-N:]
print((sum(k)))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
# bc = [c for b,c in zip(B, C) for b_ in range(b)]
# print(A+bc)
# k = sorted(A+bc)[-N:]
a = [(l, 1) for l in A]
for x, y in zip(C, B):
a.append((x,y))
n = N
ans = 0
for x, y in sorted(a, reverse=True):
if n >= y:
n -= y
ans += x*y
else:
ans += x*n
break
print(ans)
# print(sum(k))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| p03038 |
import heapq
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapq.heapify(A)
BC = [0]*M
for i in range(M):
BC[i] = list(map(int, input().split()))
BC.sort(key = lambda x: -x[1])
for i in range(M):
if A[0] > BC[i][1]:
break
for _ in range(BC[i][0]):
if A[0] > BC[i][1]:
break
heapq.heappop(A)
heapq.heappush(A, BC[i][1])
print((sum(A)))
if __name__ == '__main__':
main() | import heapq
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapq.heapify(A)
BC = [0]*M
for i in range(M):
BC[i] = list(map(int, input().split()))
BC.sort(key = lambda x: -x[1])
for B, C in BC:
if A[0] >= C:
break
for _ in range(B):
if A[0] >= C:
break
heapq.heapreplace(A, C)
print((sum(A)))
if __name__ == '__main__':
main() | p03038 |
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
Ap = []
for _ in range(M):
B,C = list(map(int,input().split()))
Ap += [C]*B
Ap.sort()
np = len(Ap)
count = 0
i,j = 0,0
while i+j < N:
a = A[N-i-1]
b = Ap[np-j-1] if j<np else 0
if a>=b and i<N:
count += a
i += 1
elif a<b and j<np:
count += b
j += 1
print(count) | N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
Ap = {}
for _ in range(M):
B,C = list(map(int,input().split()))
if C in list(Ap.keys()):
Ap[C] = Ap[C]+B
else:
Ap[C] = B
Clist = sorted(Ap.keys())
nc = len(Clist)
i,j,k = 0,0,0
count = 0
a = A[N-1]
while i+j < N:
if k<nc:
c = Clist[nc-k-1]
b = Ap[c]
else:b,c = 0,0
if a>=c:
count += a
i += 1
a = A[N-i-1]
elif c>a:
count += b*c if i+j+b<N else c*(N-i-j)
j += b
k += 1
print(count) | p03038 |
N,M = list(map(int,input().split(' ')))
A = list(map(int,input().split(' ')))
BC = []
for i in [0]*M:
#BC.append(list(map(int,input().split(' '))))
b,c = list(map(int,input().split(' ')))
A.extend([c]*b)
A.sort(reverse=True)
print((sum(A[:N])))
| N,M = list(map(int,input().split(' ')))
A = list(map(int,input().split(' ')))
for i in [0]*M:
b,c = list(map(int,input().split(' ')))
A.extend([c]*b)
A.sort(reverse=True)
print((sum(A[:N])))
| p03038 |
# https://atcoder.jp/contests/abc127/tasks/abc127_d
# 難しいこと考えすぎないこと。数字を書き換えるとは言ってるけどCjをBj枚追加して大きい方からN枚取るのが最適
# 具体的にBj枚追加していくと死ぬので、枚数はタプルでその数とともに保持しておく
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
from collections import Counter
N, M = read_ints()
A = read_ints()
BC = read_tuple(M)
cnter = Counter(A)
for b, c in BC:
cnter[c] += b
num_and_cnt = list(cnter.items())
num_and_cnt.sort(reverse=True)
ans = 0
total = 0
for num, cnt in num_and_cnt:
if total + cnt <= N:
total += cnt
ans += num * cnt
else:
while total < N:
ans += num
total += 1
print(ans)
| import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
def read_col(H):
'''
H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合
'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return tuple(map(list, list(zip(*ret))))
def read_matrix(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return ret
# return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
# https://atcoder.jp/contests/abc127/tasks/abc127_d
# わからん... データ構造で殴ります...
# いや、書き換えるっていうのは追加するっていうのと同じ意味じゃない？
# カードの枚数が多いから追加するのも大変→カードの枚数で管理しよう
N, M = read_ints()
A = read_ints()
A_cnt = Counter(A)
for _ in ra(M):
b, c = read_ints()
A_cnt[c] += b
tmp = list(A_cnt.items())
tmp.sort(key=lambda x: x[0], reverse=True)
ans = 0
cnt = 0
for k, v in tmp:
while v > 0 and cnt < N:
ans += k
v -= 1
cnt += 1
if cnt == N:
break
print(ans)
| p03038 |
def f(n,m):
a = list(map(int,input().split()))
min_a = min(a)
a = [(1,i) for i in a]
b_c = [tuple(map(int,input().split())) for i in range(m)]
a += b_c
a.sort(reverse=True,key=lambda x:x[1])
ans = 0
while True:
if n>a[0][0]:
ans += a[0][0]*a[0][1]
n -= a[0][0]
a.pop(0)
else:
ans += a[0][1]*n
break
print(ans)
n,m = list(map(int,input().split()))
f(n,m) | def f(n,m):
a = list(map(int,input().split()))
min_a = min(a)
a = [(1,i) for i in a]
b_c = [tuple(map(int,input().split())) for i in range(m)]
a += b_c
a.sort(key=lambda x:x[1])
ans = 0
while True:
if n>a[-1][0]:
ans += a[-1][0]*a[-1][1]
n -= a[-1][0]
a.pop()
else:
ans += a[-1][1]*n
break
print(ans)
n,m = list(map(int,input().split()))
f(n,m) | p03038 |
def f(n,m):
a = list(map(int,input().split()))
min_a = min(a)
for i in range(m):
b,c = list(map(int,input().split()))
if c>min_a:
a += [c]*b
a.sort()
print((sum(a[len(a)-n:])))
n,m = list(map(int,input().split()))
f(n,m) | from sys import stdin
def f(n,m):
a = [int(x) for x in stdin.readline().split()]
min_a = min(a)
a = [(1,i) for i in a]
b_c = [tuple(map(int,x.split())) for x in stdin.readlines()]
a += b_c
a.sort(key=lambda x:x[1])
ans = 0
while True:
if n>a[-1][0]:
ans += a[-1][0]*a[-1][1]
n -= a[-1][0]
a.pop()
else:
ans += a[-1][1]*n
break
print(ans)
n,m = [int(x) for x in stdin.readline().split()]
f(n,m) | p03038 |
from sys import stdin
def f():
n,m = [int(x) for x in stdin.readline().split()]
a = [int(x) for x in stdin.readline().split()]
min_a = min(a)
a = [(1,i) for i in a]
b_c = [tuple(map(int,x.split())) for x in stdin.readlines()]
a += b_c
a.sort(key=lambda x:x[1])
ans = 0
while True:
if n>a[-1][0]:
ans += a[-1][0]*a[-1][1]
n -= a[-1][0]
a.pop()
else:
ans += a[-1][1]*n
break
print(ans)
f() | from sys import stdin
def f():
n,m = [int(x) for x in stdin.readline().split()]
a = [int(x) for x in stdin.readline().split()]
min_a = min(a)
a = [(1,i) for i in a]
b_c = [tuple(map(int,x.split())) for x in stdin.readlines()]
a += b_c
a.sort(key=lambda x:x[1])
ans = 0
while True:
if n>a[-1][0]:
ans += a[-1][0]*a[-1][1]
n -= a[-1][0]
a.pop()
else:
ans += a[-1][1]*n
break
print(ans)
if __name__=='__main__':
f() | p03038 |
def check():
N, M = list(map(int, input().split()))
A = sorted([int(i) for i in input().split()])
sousa = sorted([[int(i) for i in input().split()] for i in range(M)],
reverse=True, key=lambda x:x[1])
index = 0
for cnt, value in sousa:
for i in range(cnt):
if min(A) < value:
A[index] = value
else:
return(sum(A))
index += 1
return(sum(A))
print((check())) | def check():
N, M = list(map(int, input().split()))
A = sorted([int(i) for i in input().split()])
sousa = sorted([[int(i) for i in input().split()] for i in range(M)],
reverse=True, key=lambda x:x[1])
index = 0
for cnt, value in sousa:
for i in range(cnt):
if index == N:
break
if A[index] < value:
A[index] = value
else:
return(sum(A))
index += 1
return(sum(A))
print((check())) | p03038 |
import heapq
N, M = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(M)]
heapq.heapify(a)
for b, c in bc:
for i in range(b):
hq = heapq.heappop(a)
if hq < c:heapq.heappush(a, c)
else:
heapq.heappush(a, hq)
break
print((sum(a))) | import heapq
N, M = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(M)]
bc.sort(key=lambda x:-x[1])
cnt = True
heapq.heapify(a)
for b, c in bc:
if not cnt: break
for i in range(b):
hq = heapq.heappop(a)
if hq < c:heapq.heappush(a, c)
else:
heapq.heappush(a, hq)
cnt = False
break
print((sum(a)))
| p03038 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(m):
b, c = list(map(int, input().split()))
A += [c]*b
A.sort(reverse=True)
A = A[0:n]
print((sum(A))) | n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [[0, 0] for i in range(m)]
for i in range(m):
b, c = list(map(int, input().split()))
L[i][0] = c
L[i][1] = b
L.sort(reverse=True)
cnt = 0
for i in range(m):
c, b = L[i]
A += [c]*b
cnt += b
if cnt >= n:
break
A.sort(reverse=True)
A = A[0:n]
print((sum(A)))
| p03038 |
from collections import deque
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
CB = deque([])
for i in range(M):
B, C = list(map(int, input().split()))
CB.append([C, B])
CB = sorted(CB, reverse=True)
flag = False
for i in CB:
if flag:
break
c = 0
while c < i[1]:
if i[0] > A[c]:
A[c] = i[0]
c += 1
else:
c = i[1]
flag = True
A = sorted(A)
print((sum(A))) | from collections import deque
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
CB = deque([])
for i in range(M):
B, C = list(map(int, input().split()))
CB.append([C, B])
CB = sorted(CB, reverse=True)
flag = False
c = 0
I = 0
for i in CB:
I += i[1]
if flag:
break
while c < I:
if c >= N:
break
if A[c] < i[0]:
A[c] = i[0]
c += 1
else:
c = I
flag = True
print((sum(A))) | p03038 |
import heapq
N, M = list(map(int,input().split()))
A = list(map(int,input().split()))
heapq.heapify(A)
def change(A, B, C):
for i in range(B):
tmp = heapq.heappop(A)
if tmp < C:
heapq.heappush(A, C)
else:
heapq.heappush(A, tmp)
break
for i in range(M):
B, C = list(map(int,input().split()))
change(A, B, C)
print((sum(A))) | import heapq
N, M = list(map(int,input().split()))
A = list(map(int,input().split()))
heapq.heapify(A)
B = []
C = []
for i in range(M):
tmp_B, tmp_C = list(map(int,input().split()))
B.append(tmp_B)
C.append(tmp_C)
def change(A, B, C):
for i in range(B):
tmp = heapq.heappop(A)
if tmp < C:
heapq.heappush(A, C)
else:
heapq.heappush(A, tmp)
break
ZIP = list(zip(C, B))
ZIP = reversed(sorted(ZIP))
C, B = list(zip(*ZIP))
for i in range(M):
change(A, B[i], C[i])
print((sum(A))) | p03038 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
import bisect
A.sort()
for i in range(M):
b, c = list(map(int, input().split()))
idx = bisect.bisect_left(A, c)
#print(A[:idx], A[idx:])
if idx > b:
A = A[b:idx] + [c] * b + A[idx:]
else:
#print("a", b, idx)
A = [c] * idx + A[idx:]
#print(A)
print((sum(A))) |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
CB = []
for i in range(M):
B, C = list(map(int, input().split()))
CB.append([C, B])
CB.sort(reverse=True)
idx = 0
c = 0
for i in range(N):
if A[i] < CB[idx][0]:
A[i] = CB[idx][0]
c += 1
if CB[idx][1] <= c:
idx += 1
c = 0
if idx >= M:
break
#print(A)
print((sum(A))) | p03038 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
for i in range(0,m):
b, c = list(map(int, input().split()))
for j in range(0,b):
if a[j] < c:
a[j] = c
else:
break
if b != n:
if a[b] < c:
temp = []
for j in range(0, n-b):
if a[b] < c:
temp.append(a.pop(b))
else:
break
a = temp + a
print((sum(a))) | #!/usr/bin/python3
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
b_c_hash = {}
c_list = []
for i in range(0,m):
b, c = list(map(int, input().split()))
if c in b_c_hash:
b_c_hash[c] += b
else:
b_c_hash[c] = b
c_list.append(c)
c_list.sort(reverse=True)
k = 0
flag = 0
for c in c_list:
for i in range(0, b_c_hash[c]):
if k == n:
flag = 1
break
if a[k] < c:
a[k] = c
k += 1
else:
flag = 1
break
if flag == 1:
break
print((sum(a))) | p03038 |
N, M=list(map(int, input().split()))
a=list(map(int, input().split()))
a.sort()
import bisect
for i in range(M):
b, c=list(map(int, input().split()))
t=min(b, bisect.bisect(a,c)) # c以下の要素数
a[:t]=[c]*t
a.sort()
print((sum(a)))
| n, m =list(map(int,input().split()))
A = list(map(int,input().split()))
BC = [tuple(map(int,input().split()))for i in range(m)]
A.sort()
# 書き換え得点がでかい順に並べる
BC.sort(key= lambda x : -x[1])
i = 0
f=0
for b, c in BC:
for j in range(b):
# 見てるとこがはみ出してないかつ、cより小さい
if i+j<n and A[i+j]<c:
A[i+j]=c
else: # もう走査しても意味ないからぶれーく
break
i+=b
print((sum(A))) | p03038 |
import bisect
N, M = list(map(int, input().split()))
A = [int(_) for _ in input().split()]
B = [0] * M
C = [0] * M
A.sort()
#print(A)
for m in range(M):
b, c = list(map(int, input().split()))
index = bisect.bisect_right(A, c)
#print(f'index >> {index}')
if index > 0:
if index - b < 0:
A[:index] = [c] * index
else:
A[: index - b] = A[b: index]
A[index - b: index] = [c] * b
#print(A)
print((sum(A))) | import sys
N, M = list(map(int, input().split()))
A = [int(_) for _ in input().split()]
A.sort()
#print(A)
BC = [0] * M
for m in range(M):
BC[m] = list(map(int, input().split()))
BC.sort(key=lambda x: x[1], reverse=True)
#print(BC)
c = 0
for m in range(M):
for t in range(BC[m][0]):
if BC[m][1] > A[c]:
A[c] = BC[m][1]
c += 1
if c == N:
print((sum(A)))
sys.exit()
print((sum(A))) | p03038 |
N, M = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
B = [0] * M
C = [0] * M
for j in range(M):
B[j], C[j] = [int(a) for a in input().split()]
D = list(zip(C, B))
D = sorted(D, reverse=True) # Cで降順ソート
C, B = list(zip(*D)) # 統合していた配列を元に戻す
# C[0]>= C[1] >= ... >= C[M-1]となるように並び替え、
# B[0]枚をC[0]に、B[1]枚をC[1]に書き換えていく。
# すべてのカードがC[j]以上というjに到達したらおしまい。
A.sort()
k = 0 # 現在書き換えを検討しているカード
for j in range(M):
for _ in range(B[j]):
if k >= N or A[k] >= C[j]: break
A[k] = C[j]
k += 1
print((sum(A))) | N, M = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
B = [0] * M
C = [0] * M
for j in range(M):
B[j], C[j] = [int(a) for a in input().split()]
D = list(zip(C, B))
D = sorted(D, reverse=True) # Cで降順ソート
C, B = list(zip(*D)) # 統合していた配列を元に戻す
# C[0]>= C[1] >= ... >= C[M-1]となるように並び替え、
# B[0]枚をC[0]に、B[1]枚をC[1]に書き換えていく。
# すべてのカードがC[j]以上というjに到達したらおしまい。
A.sort()
k = 0 # 現在書き換えを検討しているカード
for j in range(M):
for _ in range(B[j]):
if k >= N or A[k] >= C[j]: break
A[k] = C[j]
k += 1
else:
continue
break
print((sum(A))) | p03038 |
import sys
input=sys.stdin.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = list(map(int,input().split()))
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
from collections import defaultdict
d = defaultdict(int)
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A = sorted(A)
for i in range(M):
b,c = list(map(int,input().split()))
d[c] += b
d = dict(d)
d = sorted(list(d.items()),key = lambda x:x[0],reverse = True)
n = len(d)
index = 0
for i in range(n):
d[i] = list(d[i])
D = [0] * N
index = 0
for k in range(N):
if d[index][1] != 0:
d[index][1] -= 1
D[k] = d[index][0]
else:
index += 1
if index == n:
break
else:
d[index][1] -= 1
D[k] = d[index][0]
Max = 0
for X in range(N+1):
s = 0
for v in range(N):
if v < X:
s += D[v]
else:
s += A[v]
Max = max(s,Max)
print(Max)
| import sys
input=sys.stdin.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = list(map(int,input().split()))
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
from collections import defaultdict
d = defaultdict(int)
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A = sorted(A)
for i in range(M):
b,c = list(map(int,input().split()))
d[c] += b
d = dict(d)
d = sorted(list(d.items()),key = lambda x:x[0],reverse = True)
n = len(d)
index = 0
for i in range(n):
d[i] = list(d[i])
D = [0] * N
index = 0
for k in range(N):
if d[index][1] != 0:
d[index][1] -= 1
D[k] = d[index][0]
else:
index += 1
if index == n:
break
else:
d[index][1] -= 1
D[k] = d[index][0]
Max = 0
for p in A:
Max += p
for X in range(N):
if A[X] < D[X]:
Max += D[X] - A[X]
else:
break
print(Max) | p03038 |
import sys
import heapq
N,M=list(map(int,input().split()))
alist=list(map(int,input().split()))
cblist=[]
for i in range(M):
B,C=list(map(int,input().split()))
cblist.append((C,B))
cblist.sort(reverse=True)
hq=[]
for a in alist:
heapq.heappush(hq,a)
for C,B in cblist:
for i in range(B):
if C<hq[0]:
print((sum(hq)))
sys.exit(0)
else:
heapq.heapreplace(hq,C)
else:
print((sum(hq))) | import sys
import heapq
N,M=list(map(int,input().split()))
alist=list(map(int,input().split()))
cblist=[]
for i in range(M):
B,C=list(map(int,input().split()))
cblist.append((C,B))
cblist.sort(reverse=True)
hq=[]
for a in alist:
heapq.heappush(hq,a)
for C,B in cblist:
for i in range(B):
if C<=hq[0]:
print((sum(hq)))
sys.exit(0)
else:
heapq.heapreplace(hq,C)
else:
print((sum(hq))) | p03038 |
n,m = list(map(int,input().split()))
a_n = list(map(int,input().split()))
b_and_c = []
for i in range(m):
b_and_c.append(list(map(int,input().split())))
for i in range(m):
a_n.sort()
for j in range(b_and_c[i][0]):
if a_n[j] < b_and_c[i][1]:
a_n[j] = b_and_c[i][1]
else:
break
print((sum(a_n))) | n,m = list(map(int,input().split()))
a_n = list(map(int,input().split()))
b_and_c = []
for i in range(m):
b_and_c.append(list(map(int,input().split())))
a_n.sort()
b_and_c.sort(key = lambda x : x[1], reverse = True)
index = 0
for i in range(m):
if index >= n:
break
elif a_n[index] >= b_and_c[i][1]:
break
for j in range(index, n):
if a_n[j] < b_and_c[i][1]:
for k in range(j, min(j + b_and_c[i][0], n)):
if a_n[k] < b_and_c[i][1]:
a_n[k] = b_and_c[i][1]
else:
break
index = k + 1
break
print((sum(a_n))) | p03038 |
#!/usr/bin/env python3
import sys
import heapq
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
heapq.heapify(A)
for b, c in zip(B, C):
for i in range(b):
v = heapq.heappop(A)
if v < c:
heapq.heappush(A, c)
else:
heapq.heappush(A, v)
break
return sum(A)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
result = solve(N, M, A, B, C)
print(result)
if __name__ == '__main__':
main() | #!/usr/bin/env python3
import sys
import heapq
import bisect
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
ret = sum(A)
cs = Counter(A)
for c in C:
if c not in cs:
cs[c] = 0
vs = sorted(cs.keys())
i = 0
while cs[vs[i]] == 0:
i += 1
for b, c in zip(B, C):
while 0 < b:
if c <= vs[i]:
break
bb = min(b, cs[vs[i]])
b -= bb
cs[vs[i]] -= bb
cs[c] += bb
ret += bb * (c - vs[i])
if cs[vs[i]] == 0:
i += 1
return ret
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
result = solve(N, M, A, B, C)
if isinstance(result, Iterable) and not isinstance(result, str):
result = '\n'.join([str(v) for v in result])
print(result)
if __name__ == '__main__':
main()
| p03038 |
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
heapq.heapify(a)
for _ in range(m):
b, c = list(map(int, input().split()))
for __ in range(b):
mn = heapq.heappop(a)
if mn < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, mn)
break
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
heapq.heapify(a)
bc = sorted(
[list(map(int, input().split())) for _ in range(m)],
reverse=True,
key=lambda x: x[1],
)
for i in bc:
b, c = i
for _ in range(b):
mn = heapq.heappop(a)
if mn < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, mn)
break
print((sum(a))) | p03038 |
d = input().split()
N = int(d[0])
M = int(d[1])
d = input().split()
As = [int(num) for num in d]
As.sort()
def main():
lis = []
for i in range(1, M+1):
d = input().split()
b = int(d[0])
c = int(d[1])
lis.append([c, b])
lis = sorted(lis,key=lambda x:(-x[0], x[1]))
count = 0
asum = 0
tmp = [0 for i in range(N)]
for c, b in lis:
for i in range(count, b+count):
if i < N:
tmp[i] = c
count += b
for i in range(N):
if tmp[i] > As[i]:
asum += tmp[i]
else:
asum += As[i]
print(asum)
if __name__ == '__main__':
main()
| d = input().split()
N = int(d[0])
M = int(d[1])
d = input().split()
As = [int(num) for num in d]
As.sort()
def main():
lis = []
for i in range(1, M+1):
d = input().split()
b = int(d[0])
c = int(d[1])
lis.append([c, b])
lis = sorted(lis,key=lambda x:(-x[0], x[1]))
count = 0
asum = 0
tmp = [0 for i in range(N)]
for c, b in lis:
if count < N:
for i in range(count, b+count):
if i < N:
tmp[i] = c
count += b
for i in range(N):
if tmp[i] > As[i]:
asum += tmp[i]
else:
asum += As[i]
print(asum)
if __name__ == '__main__':
main()
| p03038 |
import sys
import os
import bisect
from operator import itemgetter
N, M = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
B = [ 0 for _ in range(M)]
for i in range(M):
b,c = list(map(int,input().split()))
B[i] = [b,c]
B = sorted(B,key=itemgetter(1),reverse=True)
for i in range(M):
id = bisect.bisect_left(A,B[i][1])
if id > 0:
for j in range(min(B[i][0],id+1)):
if A[0] < B[i][1]:
A.append(B[i][1])
del A[0]
else:
break
print((sum(A)))
| import sys
import os
import bisect
from operator import itemgetter
N, M = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
B = [ 0 for _ in range(M)]
for i in range(M):
b,c = list(map(int,input().split()))
B[i] = [b,c]
B = sorted(B,key=itemgetter(1),reverse=True)
ans = 0
for i in range(M):
id = bisect.bisect_left(A,B[i][1])
if id > 0:
for j in range(min(B[i][0],id+1)):
if len(A) > 0 and A[0] < B[i][1]:
ans += B[i][1]
del A[0]
else:
break
print((sum(A)+ans))
| p03038 |
import sys
from heapq import heapify, heapreplace
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = [int(i) for i in read().split()]
heapify(a)
for _ in range(m):
b, c = list(map(int, read().split()))
for _ in range(b):
if a[0] < c:
heapreplace(a, c)
else:
break
print((sum(a)))
if __name__ == '__main__':
main() | import sys
from operator import itemgetter
from heapq import heapify, heapreplace
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = [int(i) for i in read().split()]
bc = sorted([[int(i) for i in read().split()] for _ in range(m)], key=itemgetter(1), reverse=True)
heapify(a)
for b, c in bc:
for _ in range(b):
if a[0] < c:
heapreplace(a, c)
else:
break
print((sum(a)))
if __name__ == '__main__':
main() | p03038 |
import sys
from operator import itemgetter
from heapq import heapify, heapreplace
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = [int(i) for i in read().split()]
bc = sorted([[int(i) for i in read().split()] for _ in range(m)], key=itemgetter(1), reverse=True)
heapify(a)
for b, c in bc:
for _ in range(b):
if a[0] < c:
heapreplace(a, c)
else:
break
print((sum(a)))
if __name__ == '__main__':
main() | import sys
from operator import itemgetter
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = sorted(int(i) for i in read().split())
bc = sorted([[int(i) for i in read().split()] for _ in range(m)], key=itemgetter(1), reverse=True)
d = []
for b, c in bc:
if len(d) < n:
d += [c] * b
for i in range(min(n, len(d))):
if a[i] < d[i]:
a[i] = d[i]
else:
break
print((sum(a)))
if __name__ == '__main__':
main() | p03038 |
import sys
from operator import itemgetter
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = sorted(int(i) for i in read().split())
bc = sorted([[int(i) for i in read().split()] for _ in range(m)], key=itemgetter(1), reverse=True)
d = []
for b, c in bc:
if len(d) < n:
d += [c] * b
for i in range(min(n, len(d))):
if a[i] < d[i]:
a[i] = d[i]
else:
break
print((sum(a)))
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
a = sorted(int(i) for i in input().split())
bc = [(0, 0) for _ in range(m)]
for i in range(m):
b, c = list(map(int, input().split()))
bc[i] = (c, b)
bc.sort(reverse=True)
k = 0
d = []
for c, b in bc:
if k + b > n:
d += [c] * (n - k)
break
d += [c] * b
k += b
for i in range(len(d)):
if a[i] < d[i]:
a[i] = d[i]
else:
break
print((sum(a)))
if __name__ == '__main__':
main()
| p03038 |
def main():
n, m = list(map(int, input().split()))
a = sorted(int(i) for i in input().split())
bc = [(0, 0) for _ in range(m)]
for i in range(m):
b, c = list(map(int, input().split()))
bc[i] = (c, b)
bc.sort(reverse=True)
k = 0
d = []
for c, b in bc:
if k + b > n:
d += [c] * (n - k)
break
d += [c] * b
k += b
for i in range(len(d)):
if a[i] < d[i]:
a[i] = d[i]
else:
break
print((sum(a)))
if __name__ == '__main__':
main()
| import sys
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = list(map(int, read().split()))
a = sorted(int(i) for i in read().split())
bc = [(0, 0) for _ in range(m)]
for i in range(m):
b, c = list(map(int, read().split()))
bc[i] = (c, b)
bc.sort(reverse=True)
k = 0
d = []
for c, b in bc:
if k + b > n:
d += [c] * (n - k)
break
d += [c] * b
k += b
for i in range(len(d)):
if a[i] < d[i]:
a[i] = d[i]
else:
break
print((sum(a)))
if __name__ == '__main__':
main()
| p03038 |
import heapq
from sys import exit
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
BC = sorted([tuple(map(int, input().split())) for _ in range(M)], key=lambda x: x[1], reverse=True)
heapq.heapify(A)
ans = sum(A)
for b, c in BC:
for _ in range(b):
if len(A) == 0:
print(ans)
exit()
a = heapq.heappop(A)
if a < c:
ans += c - a
else:
print(ans)
exit()
print(ans)
| def main():
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
BC = sorted([tuple(map(int, input().split())) for _ in range(M)], key=lambda x: x[1], reverse=True)
ind = 0
for b, c in BC:
for i in range(b):
if ind == N or A[ind] >= c:
break
A[ind] = c
ind += 1
print((sum(A)))
if __name__ == '__main__':
main() | p03038 |
import sys
sys.setrecursionlimit(1000000)
from collections import defaultdict
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
dict = defaultdict(int)
for i in range(M):
B, C = list(map(int, input().split()))
dict[C] += B
idx = 0
for k, v in sorted(list(dict.items()), key=lambda x: -x[0]):
for _ in range(v):
if idx+1 <= len(A):
if A[idx] < k:
A[idx] = k
idx += 1
else:
print((sum(A)))
exit()
else:
print((sum(A)))
exit()
print((sum(A)))
| N, M = list(map(int, input().split()))
A = sorted([int(i) for i in input().split()])
BC = [tuple(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)
ans = 0
j = 0
b = 0
for i in range(N):
if j < M and A[i] < BC[j][1]:
ans += BC[j][1]
b += 1
if b == BC[j][0]:
j += 1
b = 0
else:
ans += A[i]
print(ans)
| p03038 |
n,m = list(map(int, input().split()))
a_list = [int(a) for a in input().split()]
a_list.sort()
for i in range(m):
b,c = list(map(int, input().split()))
for j in range(b):
if a_list[j]<c:
a_list[j] = c
else:
break
a_list.sort()
print((sum(a_list))) | n,m = list(map(int, input().split()))
a_list = [int(a) for a in input().split()]
a_list.sort()
bc_list = [0 for _ in range(m)]
for i in range(m):
b,c = list(map(int, input().split()))
bc_list[i] = [b,c]
bc_list.sort(key= lambda x:x[1],reverse=True)
cur = 0
for i in range(m):
b,c = bc_list[i][0],bc_list[i][1]
for j in range(b):
if cur >= n:
break
if a_list[cur]>=c:
break
else:
a_list[cur] = c
cur += 1
else:
continue
break
print((sum(a_list))) | p03038 |
#!/usr/bin/env python3
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
# bc = sorted(bc, key=lambda x: x[1], reverse=True)
# print(bc)
heapq.heapify(a)
for b, c in bc:
for i in range(b):
num = heapq.heappop(a)
if num < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, num)
break
# print(a)
print((sum(a)))
| #!/usr/bin/env python3
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc = sorted(bc, key=lambda x: x[1], reverse=True)
# print(bc)
heapq.heapify(a)
for b, c in bc:
for i in range(b):
num = heapq.heappop(a)
if num < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, num)
break
# print(a)
print((sum(a)))
| p03038 |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
a.sort()
bc.sort(reverse=True, key=lambda x:x[1])
i = 0
ans = []
for b, c in bc:
N = len(ans)
for i in range(b):
if N > n-1: break
if a[N] < c:
ans.append(c)
N += 1
else: break
print((sum(ans) + sum(a[len(ans):]))) | n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
a.sort()
bc.sort(reverse=True, key=lambda x:x[1])
i = 0
ans = 0
for b, c in bc:
for _ in range(b):
if i > n-1: break
if a[i] < c:
ans += c
i += 1
else: break
print((ans + sum(a[i:]))) | p03038 |
N,M = list(map(int,input().split()))
a_list = list(map(int,input().split()))
bc_list = []
for _ in range(M):
b,c = list(map(int,input().split()))
bc_list.append((b,c))
a_list = sorted(a_list)
bc_list = sorted(bc_list,key=lambda x: x[1],reverse=True)
count = 0
b_list = []
for b,c in bc_list:
if count >= N:
break
for _ in range(b):
b_list.append(c)
for i,a in enumerate(a_list):
if i >= len(b_list):
break
if a < b_list[i]:
a_list[i] = b_list[i]
else:
break
print((sum(a_list))) | N,M = list(map(int,input().split()))
a_list = list(map(int,input().split()))
bc_list = []
for _ in range(M):
b,c = list(map(int,input().split()))
bc_list.append([b,c])
a_list = sorted(a_list)
bc_list = sorted(bc_list,key=lambda x: x[1],reverse=True)
tmp = 0
for i,a in enumerate(a_list):
if tmp >= len(bc_list):
break
if a < bc_list[tmp][1]:
bc_list[tmp][0] -= 1
a_list[i] = bc_list[tmp][1]
else:
break
if bc_list[tmp][0] == 0:
tmp += 1
print((sum(a_list))) | p03038 |
import heapq
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
heapq.heapify(a)
for i in range(m):
b,c = list(map(int,input().split()))
for j in range(b):
d = heapq.heappop(a)
if d >= c:
heapq.heappush(a, d)
break
else:
heapq.heappush(a, c)
print((sum(a))) | n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort()
aa = [-1] * (2*n)
bc = []
for i in range(m):
b,c = list(map(int,input().split()))
bc.append((c,b))
bc.sort(reverse = True)
i = 0
for j in range(m):
if i >= n:
break
for k in range(bc[j][1]):
aa[i] = bc[j][0]
i += 1
j = 0
for i in range(n):
if a[i] < aa[j]:
a[i] = aa[j]
j += 1
print((sum(a))) | p03038 |
import sys
N, M = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
action_list = []
for i in range(M):
temp_B, temp_C = list(map(int, sys.stdin.readline().split()))
action_list.append([temp_B, temp_C])
action_list.sort(key = lambda x:x[1])
action_list.reverse()
current_list = A
count = 0
for i in range(M):
if min(current_list) > action_list[i][1]:
break
if count > N:
break
temp_list = [e for e in current_list if e < action_list[i][1]]
temp_list.sort()
other_list = [e for e in current_list if e >= action_list[i][1]]
if len(temp_list) < action_list[i][0]:
times = len(temp_list)
else:
times = action_list[i][0]
for j in range(times):
temp_list[j] = action_list[i][1]
current_list = temp_list + other_list
count += action_list[i][0]
ans = sum(current_list)
print(ans) | import sys
N, M = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
action_list = []
B = []
for i in range(M):
temp_B, temp_C = list(map(int, sys.stdin.readline().split()))
action_list.append([temp_B, temp_C])
B.append(temp_B)
action_list.sort(key = lambda x:x[1])
action_list.reverse()
current_list = A
current_list.sort()
k = 0
ans_sum = 0
count = 0
action_count = 0
if sum(B) < N:
times = sum(B)
else:
times = N
for i in range(times):
if current_list[i] < action_list[k][1]:
ans_sum += action_list[k][1]
count += 1
action_count += 1
if action_count == action_list[k][0]:
k += 1
action_count = 0
else:
break
if count > N:
break
ans_sum += sum(current_list[count:])
print(ans_sum) | p03038 |
n,m = list(map(int,input().split()))
ls = list(map(int,input().split()))
di = [list(map(int,input().split())) for _ in range(m)]
for i in range(m):
ls += [di[i][1]]*di[i][0]
ls.sort()
ls = ls[n*(-1):]
print((sum(ls))) | n,m = list(map(int,input().split()))
ls = list(map(int,input().split()))
di = [list(map(int,input().split())) for _ in range(m)]
mn = min(ls)
for i in range(m):
if di[i][1] > mn:
ls += [di[i][1]]*di[i][0]
ls.sort()
ls = ls[n*(-1):]
print((sum(ls))) | p03038 |
import heapq
n,m = list(map(int,input().split()))
ls = list(map(int,input().split()))
ls = list([x*(-1) for x in ls])
di = [list(map(int,input().split())) for _ in range(m)]
heapq.heapify(ls)
for i,j in di:
for k in range(i):
heapq.heappush(ls,j*(-1))
ans = 0
for l in range(n):
ans += (-1)*heapq.heappop(ls)
print(ans) | n,m = list(map(int,input().split()))
ls = list(map(int,input().split()))
di = [list(map(int,input().split())) for _ in range(m)]
fi = []
for i,j in di:
fi.append([j,i])
for k in ls:
fi.append([k,1])
fi.sort(reverse=True)
ans = 0
cnt = 0
how = 0
while True:
if how + fi[cnt][1] < n:
how += fi[cnt][1]
ans += fi[cnt][1]*fi[cnt][0]
else:
ans += (n-how)*fi[cnt][0]
break
cnt += 1
print(ans)
| p03038 |
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[list(map(int,input().split())) for _ in range(m)]
for b,c in B:A+=[c]*b
print((sum(sorted(A)[-n:]))) | from operator import itemgetter
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[list(map(int,input().split())) for _ in range(m)]
B.sort(key=itemgetter(1),reverse=True)
C=[]
for b,c in B:
C+=[c]*b
if len(C)>=n:break
print((sum(sorted(A+C)[-n:]))) | p03038 |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
b, c = list(map(int, input().split()))
a += [c] * b
a.sort(reverse = True)
print((sum(a[:n]))) | n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
b, c = list(map(int, input().split()))
a += [c] * b
a.sort(reverse = True)
a = a[:n]
a.sort(reverse = True)
print((sum(a[:n]))) | p03038 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
saisyo = min(A)
saidai = max(A)
cb = []
count = 0
memo = 10 **10
for _ in range(M):
b, c = list(map(int, input().split()))
if c > saisyo and count < N: #枝刈り
A += [c] * b
if c > saidai:
if count > N:
if c >= memo:
cb += [c] * b
else:
count += b
cb += [c] * b
memo = min(memo, c)
ans = 0
if count < N:
A.sort(reverse = True)
for i in range(N):
ans += A[i]
if count >= N:
cb.sort(reverse = True)
for i in range(N):
ans += cb[i]
print (ans) | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cb = []
for i in A:
cb += [[i,1]]
for _ in range(M):
b, c = list(map(int, input().split()))
cb += [[c, b]]
cb.sort(reverse = True)
#print (cb)
ans = 0
i = 0
j = 0
while i <= N:
a = min(N-i, cb[j][1])
ans += cb[j][0] * a
j += 1
i += a
#print (ans)
if i == N:
print (ans)
i += 1
| p03038 |
from heapq import heapify, heappop, heappush
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapify(A)
for i in range(M):
B, C = list(map(int, input().split()))
for i in range(B):
e = heappop(A)
if e < C:
heappush(A, C)
else:
heappush(A, e)
break
ans = sum(A)
print(ans) | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
D = {}
for a in A:
if a in D:
D[a] += 1
else:
D[a] = 1
for i in range(M):
B, C = list(map(int, input().split()))
if C in D:
D[C] += B
else:
D[C] = B
K = sorted(list(D.keys()), reverse=True)
ans = 0
cnt = N
for k in K:
a = min(D[k], cnt)
ans += k * a
cnt -= a
if cnt == 0: break
print(ans) | p03038 |
n,m = list(map(int, input().split()))
a = list(map(int,input().split()))
for _ in range(m):
b,c = list(map(int, input().split()))
a += [c]*b
a.sort()
print((sum(a[-n:])))
| from heapq import heappop, heappush
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
pq = []
ans = 0
for a in A:
heappush(pq, [-a, 1])
for _ in range(m):
b,c = list(map(int,input().split()))
heappush(pq, [-c, b])
for i in range(n):
c,b = heappop(pq)
c = -c
ans += c
if b > 1:
b -= 1
heappush(pq, [-c, b])
print(ans) | p03038 |
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
BC=[list(map(int,input().split())) for _ in range(M)]
A.sort()
for B,C in BC:
for i in range(N):
if (B==0)or(A[i]>=C):
break
else:
A[i]=C
B-=1
A.sort()
print((sum(A))) | N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
BC=[list(map(int,input().split())) for _ in range(M)]
count=0
D=[]
BC.sort(key=lambda x:x[1],reverse=True)
A.sort()
for B,C in BC:
D+=[C]*B
count+=B
if count>=N:
break
D=D[:N]
for i in range(len(D)):
d=D[i]
if A[i]<d:
A[i]=d
else:
break
print((sum(A))) | p03038 |
from heapq import heapify, heapreplace
N, M = list(map(int, input("").split(" ")))
A = list(map(int, input("").split(" ")))
A = list(A)
heapify(A)
for i in range(M):
B, C = list(map(int, input("").split(" ")))
for j in range(B):
if A[0] < C:
heapreplace(A, C)
else:
break
print((sum(A))) | N, M = list(map(int, input("").split(" ")))
A = list(map(int, input("").split(" ")))
A = list(A)
A.sort()
potentials = []
for i in range(M):
B, C = list(map(int, input("").split(" ")))
potentials.append((B, C))
potentials.sort(key=lambda x: x[1], reverse=True)
c = 0
for p in potentials:
for b in range(p[0]):
if p[1] > A[c]:
A[c] = p[1]
c += 1
if c >= len(A):
break
else:
break
if c >= len(A):
break
print((sum(A)))
| p03038 |
import bisect
n, m = list(map(int, input().split()))
A = sorted(map(int, input().split()))
BC = []
for j in range(m):
b, c = list(map(int, input().split()))
BC.append((b, c))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
ans = 0
for b, c in BC:
i = bisect.bisect_left(A, c)
if i == 0:
break
else:
change = min(i, b)
ans += c * change
A = A[change:]
ans += sum(A)
print(ans) | n, m = list(map(int, input().split()))
A = sorted(map(int, input().split()))
BC = []
for j in range(m):
b, c = list(map(int, input().split()))
BC.append((b, c))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
D = []
for b, c in BC:
D.extend([c for i in range(b)])
if len(D) >= n:
D = D[:n]
break
for x in range(len(D)):
if A[x] > D[x]:
break
else:
x += 1
print((sum(A[x:]) + sum(D[:x]))) | p03038 |
import bisect
from collections import deque
n, m = list(map(int, input().split()))
A = deque(sorted(map(int, input().split())))
BC = []
for j in range(m):
b, c = list(map(int, input().split()))
BC.append((b, c))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
for b, c in BC:
change = 0
for i, a in enumerate(A):
if i == b:
break
if a < c:
change += 1
for _ in range(change):
A.popleft()
A.append(c)
print((sum(A))) | import bisect
from collections import deque
n, m = list(map(int, input().split()))
A = deque(sorted(map(int, input().split())))
BC = []
for j in range(m):
b, c = list(map(int, input().split()))
BC.append((b, c))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
for b, c in BC:
change = 0
for i in range(b):
if A[i] < c:
change += 1
if not change:
break
for _ in range(change):
A.popleft()
A.append(c)
print((sum(A))) | p03038 |
#-*- coding:utf-8 -*-
import bisect
N, M = list(map(int, input().split()))
A = [int(a) for a in input().split()]
BC = [0]*M
for i in range(M):
BC[i] = [int(n) for n in input().split()]
A.sort() # 昇順ソートO(NlogN)
BC.sort(key=(lambda x: x[1]), reverse=True) # Ciの値で降順ソート
for i in range(M):
b, c = BC[i]
# cが降順なので、入替回数が減る？
idx = bisect.bisect_left(A, c)
if idx > 0:
for j in range(min(idx,b)):
A[j] = c
A.sort()
print((sum(A))) | #-*- coding:utf-8 -*-
import bisect
N, M = list(map(int, input().split()))
A = [int(a) for a in input().split()]
BC = [0]*M
for i in range(M):
BC[i] = [int(n) for n in input().split()]
A.sort() # 昇順ソートO(NlogN)
BC.sort(key=(lambda x: x[1]), reverse=True) # Ciの値で降順ソート
st = 0 # 編集開始位置
for i in range(M): # O(MlogN)
b, c = BC[i]
idx = bisect.bisect_left(A, c, st) # A全体でのidxを返す
edit = idx - st # 編集個数
edit = min(b, edit)
for j in range(edit):
A[st+j] = c
st += edit
print((sum(A))) | p03038 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N, M = MAP()
A = LIST()
BC = [LIST() for _ in range(M)]
for B, C in BC:
for i in range(B):
A.append(C)
A.sort(reverse=True)
print((sum(A[0:N])))
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N, M = MAP()
A = LIST()
BC = [LIST() for _ in range(M)]
A.sort(reverse=True)
BC.sort(key=lambda x:-x[1])
# print(A)
# print(BC)
count = 0
ans = 0
while count < N:
if BC and A[0] < BC[0][1]: # BCからとる
if BC[0][0] + count > N:
ans += BC[0][1] * (N-count)
count = N
else:
count += BC[0][0]
ans += BC[0][1] * BC[0][0]
# print(count, ans)
BC.pop(0)
else:
count += 1
ans += A.pop(0)
# print(count, ans)
print(ans)
| p03038 |
from heapq import heapify, heappop, heappush
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
heapify(A)
for _ in range(m):
b, c = list(map(int, input().split()))
for _ in range(b):
min_num = heappop(A)
if min_num < c:
heappush(A, c)
else:
heappush(A, min_num)
break
total = sum(A)
print(total) | from heapq import heapify, heappop, heappush
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
heapify(A)
BC = [tuple(map(int, input().split())) for _ in range(m)]
BC.sort(key=lambda x: x[1], reverse=True)
for i in range(m):
for _ in range(BC[i][0]):
min_num = heappop(A)
if min_num < BC[i][1]:
heappush(A, BC[i][1])
else:
heappush(A, min_num)
break
total = sum(A)
print(total)
| p03038 |
from heapq import heappop,heappush,heapify
from collections import deque
import bisect
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = [int (i) for i in input().split()]
A.sort()
D = []
P = 0
for i in range(M):
B,C = list(map(int, input().split()))
D.extend([C]*B)
P += B
D.sort(reverse=True)
ans = sum(A)
for i in range(min(P,N)):
if A[i] < D[i]:
ans += D[i] - A[i]
else:
break
print(ans) | from heapq import heappop, heappush, heapify
from collections import deque
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
S = []
for i in range(M):
B,C = list(map(int, input().split()))
for j in range(B):
heappush(S,-C)
A.sort()
i = 0
l = len(S)
while i < min(N,l):
q = -1*heappop(S)
if A[i] < q:
A[i] = q
i += 1
else:
break
print((sum(A))) | p03038 |
from heapq import heappop, heappush, heapify
from collections import deque
import bisect
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
A.sort()
for i in range(M):
B,C = list(map(int, input().split()))
for j in range(B):
idx = bisect.insort_left(A,C)
print((sum(A[-N:]))) | N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
table = []
for i in range(N):
table.append((A[i],1))
for i in range(M):
b,c = list(map(int, input().split()))
table.append((c,b))
table.sort()
count = 0
ans = 0
while True:
c, b = table.pop()
if b <= N - count:
ans += c*b
count += b
else:
ans += (N-count)*c
break
print(ans) | p03038 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = []
C = []
for i in range(M):
b, c = list(map(int, input().split()))
B.append(b)
C.append(c)
C_arr = []
for i in range(M):
for _ in range(B[i]):
C_arr.append(C[i])
C_arr.sort(reverse=True)
A.sort()
ans = []
for i in range(N):
if i < len(C_arr):
ans_item = max(A[i], C_arr[i])
else:
ans_item = A[i]
ans.append(ans_item)
print((sum(ans)))
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
BC = [list(map(int, input().split())) for i in range(M)]
# Cについて大きい順にソート
BC.sort(key=lambda x: x[1], reverse=True)
temp = []
for i in range(M):
# CiをBi個追加
temp += [BC[i][1]] * BC[i][0]
if len(temp) > N:
break
A += temp
A.sort(reverse=True)
print((sum(A[:N])))
| p03038 |
import heapq
N, M = tuple(map(int, input().split()))
A = list(map(int, input().split()))
B, C = [], []
for _ in range(M):
b, c = tuple(map(int, input().split()))
B.append(b)
C.append(c)
heapq.heapify(A)
for b, c in zip(B, C):
for _ in range(b):
min_val = A[0]
if min_val < c:
heapq.heappop(A)
heapq.heappush(A, c)
else:
break
print((sum(A))) | import heapq
N, M = tuple(map(int, input().split()))
A = list(map(int, input().split()))
BC = []
for _ in range(M):
BC.append(tuple(map(int, input().split())))
BC.sort(key=lambda x: x[1], reverse=True)
heapq.heapify(A)
for (b, c) in BC:
for _ in range(b):
min_val = A[0]
if min_val < c:
heapq.heappop(A)
heapq.heappush(A, c)
else:
break
print((sum(A))) | p03038 |
import sys
fin = sys.stdin.readline
N, M = list(map(int, fin().split()))
As = list(map(int, fin().split()))
BC = [tuple(map(int, fin().split())) for _ in range(M)]
As = sorted(As)
# BC = sorted(BC, key=lambda x: x[1], reverse=True)
BC_ = {}
for num, val in BC:
if val in BC_:
BC_[val] += num
else:
BC_[val] = num
BC_ = sorted(list(BC_.items()), reverse=True)
#
# def f(a, n, v):
# if a[min(n-1, len(a)-1)] < v:
# return v * min(n, len(a)), a[n:]
# count = 0
# for i in range(min(n, len(a))):
# if a[i] < v:
# count += 1
# else:
# break
# return v * count, a[count:]
sum__ = 0
for val, num in BC_:
if len(As) == 0 or As[0] >= val:
break
if As[min(num - 1, len(As) - 1)] < val:
sum_, As = val * min(num, len(As)), As[num:]
else:
count = 0
for i in range(min(num, len(As))):
if As[i] < val:
count += 1
else:
break
sum_, As = val * count, As[count:]
sum__ += sum_
print((sum__ + sum(As)))
| import sys
fin = sys.stdin.readline
N, M = list(map(int, fin().split()))
As = list(map(int, fin().split()))
BC = [tuple(map(int, fin().split())) for _ in range(M)]
As = sorted(As)
# BC = sorted(BC, key=lambda x: x[1], reverse=True)
BC_ = {}
for num, val in BC:
if val in BC_:
BC_[val] += num
else:
BC_[val] = num
BC_ = sorted(list(BC_.items()), reverse=True)
#
# def f(a, n, v):
# if a[min(n-1, len(a)-1)] < v:
# return v * min(n, len(a)), a[n:]
# count = 0
# for i in range(min(n, len(a))):
# if a[i] < v:
# count += 1
# else:
# break
# return v * count, a[count:]
sum__ = 0
now = 0
for val, num in BC_:
if now >= len(As) or As[now] >= val:
break
if As[min(num - 1 + now, len(As) - 1)] < val:
sum_ = val * min(num, len(As) - now)
now += min(num, len(As) - now)
else:
count = 0
for i in range(min(num, len(As)-now)):
if As[i + now] < val:
count += 1
else:
break
sum_ = val * count
now += count
sum__ += sum_
print((sum__ + sum(As[now:])))
| p03038 |
import math # noqa
import bisect # noqa
import queue # noqa
if __name__ == '__main__':
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
que = queue.PriorityQueue()
for a in A:
que.put(a)
for _ in range(M):
B, C = list(map(int, input().split()))
for i in range(0, B):
a = que.get()
if a < C:
que.put(C)
else:
que.put(a)
break
ans = 0
while not que.empty():
ans += que.get()
print(ans)
| import math # noqa
import bisect # noqa
import queue # noqa
if __name__ == '__main__':
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = {}
for a in A:
if a not in cnt:
cnt[a] = 1
else:
cnt[a] += 1
for _ in range(M):
B, C = list(map(int, input().split()))
if C not in cnt:
cnt[C] = B
else:
cnt[C] += B
cnt = [[k, v] for k, v in list(cnt.items())]
cnt.sort(reverse=True)
ans = 0
for k, v in cnt:
if N <= v:
ans += k * N
break
else:
ans += k * v
N -= v
print(ans)
| p03038 |
N,M = (int(x) for x in input().split())
A_arr = [int(x) for x in input().split()]
BC_arr = [[0,0] for _ in range(M)]
for i in range(M):
b,c = (int(x) for x in input().split())
BC_arr[i][0] = b
BC_arr[i][1] = c
A_arr.sort()
for BC in BC_arr:
Bi = BC[0]
Ci = BC[1]
for j in range(Bi):
if A_arr[j] < Ci:
A_arr[j] = Ci
else:
break
A_arr.sort()
print((sum(A_arr)))
| N,M = (int(x) for x in input().split())
A_arr = [int(x) for x in input().split()]
BC_arr = [[0,0] for _ in range(M)]
for i in range(M):
b,c = (int(x) for x in input().split())
BC_arr[i][0] = b
BC_arr[i][1] = c
A_arr.sort()
BC_arr.sort(key=lambda x:x[1], reverse=True)
break_th = False
j_count = 0
for BC in BC_arr:
Bi = BC[0]
Ci = BC[1]
for j in range(Bi):
if A_arr[j_count] >= Ci:
break_th = True
break
A_arr[j_count] = Ci
j_count += 1
if j_count == N:
break_th = True
break
if break_th:
break
print((sum(A_arr)))
| p03038 |
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(0,M):
b,c = list(map(int,input().split()))
for j in range(0,b):
A.append(c)
A.sort()
result = 0
start = len(A)-1
for k in range(start,start-N,-1):
result += A[k]
print(result)
| N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
cards = []
for i in range(0,N):
cards.append((A[i],1))
for i in range(0,M):
b,c = list(map(int,input().split()))
cards.append((c,b))
cards.sort()
cards.reverse()
result = 0
total = N
for num, cnt in cards:
total -= cnt
result += num*cnt
if total < 0:
result += num * total
break
print(result)
| p03038 |
# 高速版input
import sys
input = sys.stdin.readline
# 二分探索
import bisect
n,m = (int(i) for i in input().split())
a = sorted([int(i) for i in input().split()])
bc = [[int(i) for i in input().split()] for i in range(m)]
for b,c in bc:
idx = bisect.bisect_left(a,c)
a = (a[:idx] + [c]*b + a[idx:])[b:]
print((sum(a))) | # 高速版input
import sys
input = sys.stdin.readline
n,m = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
bc = [[int(i) for i in input().split()] for i in range(m)]
x = []
for b,c in sorted(bc, key=lambda x: x[1], reverse=True):
x.extend([c]*b)
if len(x) > n:
break
a.extend(x)
print((sum(sorted(a,reverse=True)[:n])))
| p03038 |
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
heapq.heapify(a)
for i in range(m):
b , c = list(map(int,input().split()))
for j in range(b):
p = heapq.heappop(a)
if p >= c:
heapq.heappush(a,p)
break
else:
heapq.heappush(a,c)
print((sum(a))) | n, m = list(map(int, input().split()))
a = list([[int(x),1] for x in input().split()])
for i in range(m):
b , c = list(map(int,input().split()))
a.append([c,b])
a.sort(reverse = True)
ans = 0
for x,y in a:
if y < n:
ans += x*y
n = n-y
elif y >=n:
ans += x*n
break
print(ans) | p03038 |
import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
readline = sys.stdin.readline
a = [int(i) for i in readline().split()]
#bc = [[int(i) for i in readline().split()] for _ in range(m)]
import heapq
heapq.heapify(a)
for i in range(m):
# b = bc[i][0]; c = bc[i][1]
b,c = [int(i) for i in readline().split()]
for _ in range(b):
if a[0] < c:
_ = heapq.heappop(a)
heapq.heappush(a, c)
else:
break
ans = sum(a)
print(ans) | import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
readline = sys.stdin.readline
A = [int(i) for i in readline().split()]
A.sort()
CB = []
for _ in range(m):
b, c = [int(i) for i in readline().split()]
CB.append([c, b])
CB.sort(reverse=True)
idx = 0
c = 0
for i in range(n):
if A[i] < CB[idx][0]:
A[i] = CB[idx][0]
c += 1
if CB[idx][1] <= c:
idx += 1
c = 0
if idx >= m:
break
print((sum(A))) | p03038 |
N,M = list(map(int,input().split()))
A_s = list(map(int,input().split()))
for _ in range(M):
B,C = list(map(int,input().split()))
A_s.extend([C] * B)
A_s = sorted(A_s)
print((sum(A_s[-N:])))
| N,M = list(map(int,input().split()))
A_s = list(map(int,input().split()))
BC_s = []
for _ in range(M):
tempB,tempC = list(map(int,input().split()))
BC_s.append([tempB,tempC])
BC_s = reversed(sorted(BC_s, key=lambda x:x[1]))
D = []
A_s = sorted(A_s)
A_s_size = N
for BC in BC_s:
B = BC[0]
C = BC[1]
if A_s_size == 0:
break
elif A_s_size < B:
D.extend([C]*A_s_size)
A_s_size -= A_s_size
else:
D.extend([C]*B)
A_s_size -= B
minLength = min(N,len(D))
for i in range(minLength):
if A_s[i] < D[i]:
A_s[i] = D[i]
else:
break
print((sum(A_s[-N:])))
| p03038 |
n, m = list(map(int,input().split()))
l = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(m)]
# n,m = 3,2
# l = [5,1,4]
# s = [[2,3],[1,5]]
# l = [1, 8, 5, 7, 100, 4, 52, 33, 13, 5]
l.sort()
s.sort(key=lambda x: x[1], reverse=True)
idx = 0
for i in range(m):
for j in range(idx, min(n, idx + s[i][0])):
if l[j] < s[i][1]:
l[j] = s[i][1]
idx += s[i][0]
# else:
# idx += s[i][0]
# break
print((sum(l))) | n, m = list(map(int,input().split()))
l = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(m)]
# n,m = 3,2
# l = [5,1,4]
# s = [[2,3],[1,5]]
# l = [1, 8, 5, 7, 100, 4, 52, 33, 13, 5]
l.sort()
s.sort(key=lambda x: x[1], reverse=True)
idx = 0
for i in range(m):
for j in range(idx, min(n, idx + s[i][0])):
if l[j] < s[i][1]:
l[j] = s[i][1]
else:
break
idx += s[i][0]
print((sum(l))) | p03038 |
def main():
N, M = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
bcs = [[int(i) for i in input().split()] for _ in range(M)]
bcs.sort(reverse=True,key=lambda c:c[1])
ans = 0
sel = []
for a in A:
if a < bcs[0][1]:
sel.append(a)
else:
ans += a
sel.sort()
bcs = [[c] * b for b,c in bcs]
stock = len(sel)
from itertools import chain,zip_longest
cnt = 0
for a,card in zip_longest(sel,chain.from_iterable(bcs),fillvalue=0):
if cnt == stock:
break
if a < card:
ans += card
else:
ans += a
cnt += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
N, M = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
bcs = [[int(i) for i in input().split()] for _ in range(M)]
bcs.sort(reverse=True,key=lambda c:c[1])
ans = 0
sel = []
for a in A:
if a < bcs[0][1]:
sel.append(a)
else:
ans += a
sel.sort()
stock = len(sel)
cards = []
for b,c in bcs:
cards.extend([c] * b)
if len(cards) >= stock:
break
from itertools import zip_longest
cnt = 0
for a,card in zip_longest(sel,cards,fillvalue=0):
if cnt == stock:
break
if a < card:
ans += card
else:
ans += a
cnt += 1
print(ans)
if __name__ == "__main__":
main()
| p03038 |
import heapq
N, M = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
AA = [[a, 1] for a in A]
while 2 <= len(AA) and AA[0][0] == AA[1][0] :
_, cnt = AA.pop(0)
AA[0][1] += cnt
H = []
for aa in AA :
heapq.heappush(H, aa)
for i in range(M) :
#print(H)
B, C = list(map(int, input().split(' ')))
s = 0
while len(H) > 0 and B > 0 :
h = heapq.heappop(H)
if C <= h[0] :
heapq.heappush(H, h)
break
elif B <= h[1] :
h[1] -= B
if h[1] > 0 :
heapq.heappush(H, h)
s += B
break
else :
B -= h[1]
s += h[1]
if s > 0 :
heapq.heappush(H, [C, s])
#print(H)
ans = 0
for h in H :
ans += h[0] * h[1]
print(ans)
| N, M = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
A = [(1, a) for a in A]
D = [ tuple(map(int, input().split(' '))) for _ in range(M)]
AD = A + D
AD.sort(key = lambda x : -x[1])
ans = 0
cnt = 0
for ad in AD :
if N < cnt + ad[0] :
ans += ad[1] * (N - cnt)
break
else :
cnt += ad[0]
ans += ad[1] * ad[0]
print(ans)
| p03038 |
argN,argM = list(map(int,input().split()))
aryA = list(map(int,input().split()))
wkA = aryA[:]
for i in range(argM):
argB,argC = list(map(int,input().split()))
wkA += [argC] * argB
wkA.sort()
wkA.reverse()
print((sum(wkA[:len(aryA)]))) | argN,argM = list(map(int,input().split()))
aryA = list(map(int,input().split()))
aryCB = []
for i in range(argM):
aryBC = list(map(int,input().split()))
#print(aryBC)
aryBC.reverse()
aryCB.append(aryBC[:])
#print(aryCB)
aryCB.sort(reverse=True)
#print(aryCB)
aryD = []
for i in range(len(aryCB)):
if len(aryD) + aryCB[i][1] < argN:
aryD += [aryCB[i][0]] * aryCB[i][1]
elif len(aryD) < argN:
wk = argN - len(aryD)
aryD += [aryCB[i][0]] * wk
wkA = aryA[:] + aryD[:]
#print(wkA)
wkA.sort(reverse=True)
print((sum(wkA[:len(aryA)])))
| p03038 |
import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
heapq.heapify(a)
for i in range(m):
b,c=list(map(int,input().split()))
for j in range(b):
x=a[0]
if x<c:
heapq.heappop(a)
heapq.heappush(a, c)
else:
break
print((sum(a))) | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
d=[]
for i in range(m):
b,c=list(map(int,input().split()))
d.append([b,c])
d=sorted(d, key=lambda x: x[1], reverse=True)
i=0
j=d[0][1]
k=0
while a[i]<j:
a[i]=j
d[k][0]-=1
if d[k][0]==0:
k+=1
if k==m:
break
else:
j=d[k][1]
i+=1
if i==n:
break
print((sum(a))) | p03038 |
import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
h = []
for a in A:
heapq.heappush(h, a)
for i in range(M):
B, C = list(map(int, input().split()))
for i in range(B):
vmin = heapq.heappop(h)
if vmin < C:
heapq.heappush(h, C)
else:
heapq.heappush(h, vmin)
break
print((sum(h)))
| import math
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
CB = []
for i in range(M):
B, C = list(map(int, input().split()))
CB.append([C, B])
CB.sort(reverse=True)
p = 0
for C, B in CB:
while p < len(A) and A[p] >= C:
p += 1
if p >= len(A):
break
for i in range(B):
if p >= len(A):
break
if A[p] < C:
A[p] = C
p += 1
else:
break
print((sum(A)))
| p03038 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import defaultdict
def main():
N, M = LI()
A = LI()
BC = []
for _ in range(M):
BC.append(LI())
A.sort()
for B, C in BC:
for i in range(B):
if C <= A[i]:
break
A[i] = C
A.sort()
ans = sum(A)
return ans
print((main())) | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import defaultdict
from operator import itemgetter
def main():
N, M = LI()
A = LI()
BC = []
for _ in range(M):
BC.append(LI())
for a in A:
BC.append([1, a])
BC.sort(reverse=True, key=itemgetter(1))
cnt = 0
ans = 0
for B, C in BC:
if cnt + B >= len(A):
ans += C * (len(A) - cnt)
break
ans += C * B
cnt += B
return ans
print((main())) | p03038 |
import heapq
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapq.heapify(A)
for _ in range(M):
b, c = list(map(int, input().split()))
for i in range(b):
if A[0] < c:
heapq.heappushpop(A, c)
else:
break
return sum(A)
print((main()))
| import heapq
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [(1, -i) for i in A]
heapq.heapify(A)
for _ in range(M):
b, c = list(map(int, input().split()))
B.append((b,-c))
B.sort(key=lambda x: x[1])
t = 0
i = 0
tl = []
while t < N:
tl.extend([-B[i][1]] * B[i][0])
t += B[i][0]
i += 1
return sum(tl[:(N)])
print((main()))
| p03038 |
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [0] * M
C = [0] * M
Y = []
for i in range(M):
B[i], C[i] = list(map(int, input().split()))
Y += [C[i]] * B[i]
A.extend(Y)
A.sort(reverse=True)
print((sum(A[:N]))) | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
CB = []
for i in range(M):
B, C = list(map(int, input().split()))
CB.append([C, B])
A.sort()
A.reverse()
CB.sort()
CB.reverse()
ans = 0
a_index = 0
cb_index = 0
f = 0
while True:
if f == 1 or A[a_index] >= CB[cb_index][0]:
ans += A[a_index]
a_index += 1
N -= 1
if N == 0:
break
else:
if N <= CB[cb_index][1]:
ans += CB[cb_index][0] * N
break
else:
ans += CB[cb_index][0] * CB[cb_index][1]
N -= CB[cb_index][1]
cb_index += 1
if len(CB) == cb_index:
f = 1
print(ans) | p03038 |
def I(): return int(eval(input()))
def LI(): return list(map(int,input().split()))
def MI(): return list(map(int,input().split()))
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
n,m = MI()
card = LI()
for i in range(m):
b,c = MI()
card += [c]*b
card.sort(reverse = True)
print((sum(card[:n])))
| def I(): return int(eval(input()))
def LI(): return list(map(int,input().split()))
def MI(): return list(map(int,input().split()))
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
#bisect.bisect_left(list,key)はlistのなかでkey未満の数字がいくつあるかを返す
#つまりlist[i] < x となる i の個数
#bisect.bisect_right(list, key)はlistのなかでkey以下の数字がいくつあるかを返す
#つまりlist[i] <= x となる i の個数
#これを応用することで
#len(list) - bisect.bisect_left(list,key)はlistのなかでkey以上の数字がいくつあるかを返す
#len(list) - bisect.bisect_right(list,key)はlistのなかでkeyより大きい数字がいくつあるかを返す
#これらを使うときはあらかじめlistをソートしておくこと！
n,m = MI()
card = LI()
for i in range(m):
b,c = MI()
card += [c]*b
card.sort(reverse = True)
print((sum(card[:n])))
| p03038 |
import queue
def integer_cards(N: int, M: int, A: list, queries: list)->int:
que = queue.PriorityQueue()
for a in A:
que.put(a)
for B, C in queries:
for _ in range(B):
x = que.get()
que.put(max(x, C))
res = 0
for _ in range(N):
res += que.get()
return res
if __name__ == "__main__":
M = 0
N, M = list(map(int, input().split()))
A = [int(s) for s in input().split()]
queries = [tuple(int(s) for s in input().split()) for _ in range(M)]
ans = integer_cards(N, M, A, queries)
print(ans)
| import queue
def integer_cards(N: int, M: int, A: list, queries: list)->int:
que = queue.PriorityQueue()
for a in A:
que.put(a)
queries.sort(key=lambda x: -x[1])
for B, C in queries:
x = que.get()
que.put(x)
if C <= x:
break
for _ in range(B):
x = que.get()
que.put(max(x, C))
if C <= x:
break
res = 0
for _ in range(N):
res += que.get()
return res
if __name__ == "__main__":
M = 0
N, M = list(map(int, input().split()))
A = [int(s) for s in input().split()]
queries = [tuple(int(s) for s in input().split()) for _ in range(M)]
ans = integer_cards(N, M, A, queries)
print(ans)
| p03038 |
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD=10**9+7
N,M=rl()
A=rl()
B=[0]*M
C=[0]*M
for i in range(M):
B[i],C[i]=rl()
for b,c in zip(B,C):
A.extend([c]*b)
A.sort(reverse=True)
print(sum(A[:N]))
| import sys
input = sys.stdin.readline
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD=10**9+7
N,M=rl()
A=rl()
B=[0]*M
C=[0]*M
for i in range(M):
B[i],C[i]=rl()
D = []
for a in A:
D.append([a,1])
for b,c in zip(B,C):
D.append([c,b])
D.sort(reverse=True)
ans = 0
cnt = N
for val,num in D:
if cnt >= num:
cnt -= num
ans += val*num
else:
ans += val*cnt
break
print(ans)
| p03038 |
n, m = list(map(int, input().split()))
cards = list(map(int, input().split()))
for i in range(m):
b, c = list(map(int, input().split()))
cards += ([c] * b)
cards.sort(reverse=True)
print((sum(cards[:n]))) | n, m = list(map(int, input().split()))
cards = list(map(int, input().split()))
for i in range(m):
b, c = list(map(int, input().split()))
cards += ([c] * b)
cards = sorted(cards, reverse=True)[:n]
print((sum(cards))) | p03038 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cards = [list(map(int, input().split())) for i in range(M)]
for card in cards:
A += [card[1]]*card[0]
A.sort(reverse=True)
print((sum(A[:N])))
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
b, c = list(map(int, input().split()))
A += [c]*b
A.sort(reverse=True)
print((sum(A[:N])))
| p03038 |
import heapq
N, M = list(map(int, input().split()))
arr = list(map(int, input().split()))
heapq.heapify(arr)
for i in range(M):
B, C = list(map(int, input().split()))
count = 0
while True:
a = heapq.heappop(arr)
if a >= C or B <= count:
heapq.heappush(arr,a)
break
else:
count += 1
heapq.heappush(arr,C)
print((sum(arr))) | import heapq
N, M = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(M)]
heapq.heapify(a)
bc = sorted(bc, reverse=True, key=lambda x: x[1])
for i in range(M):
count = 0
while True:
t = heapq.heappop(a)
if t >= bc[i][1] or bc[i][0] <= count:
heapq.heappush(a,t)
break
else:
count += 1
heapq.heappush(a,bc[i][1])
print((sum(a))) | p03038 |
import sys
import heapq
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N, M = list(map(int, input().split()))
H = []
for i in list(map(int, input().split())):
heapq.heappush(H, [-i, 1])
for i in range(M):
b, c = list(map(int, input().split()))
heapq.heappush(H, [-c, b])
cnt = 1
ans = 0
while cnt <= N:
c, b = heapq.heappop(H)
c = -c
ans += c
if b > 1:
b -= 1
heapq.heappush(H, [-c, b])
cnt += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
import heapq
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N, M = list(map(int, input().split()))
H = []
for i in list(map(int, input().split())):
heapq.heappush(H, (-i, 1))
for i in range(M):
b, c = list(map(int, input().split()))
heapq.heappush(H, (-c, b))
cnt = 1
ans = 0
while cnt <= N:
c, b = heapq.heappop(H)
c = -c
ans += c
if b > 1:
b -= 1
heapq.heappush(H, (-c, b))
cnt += 1
print(ans)
if __name__ == "__main__":
main()
| p03038 |
n, m = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a = sorted(a)
l = []
for i in range(m):
b, c = list(map(int, input().split()))
x = [c]*b
l += x
a = a+l
a = sorted(a)
a = a[-n:]
print((sum(a))) | n, m = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a = sorted(a)
l = []
for i in range(m):
l.append(list(map(int, input().split())))
l = sorted(l, reverse=True, key=lambda x: x[1])
b = []
for _ in range(n):
b.append(l[0][1])
l[0][0] -= 1
if l[0][0] == 0:
l.pop(0)
if l == []:
break
for i in range(len(b)):
if a[i] < b[i]:
a[i] = b[i]
else:
break
print((sum(a)))
| p03038 |
import sys
from collections import deque
input = sys.stdin.readline
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
lis = []
for _ in range(M):
B, C = list(map(int, input().split()))
for _ in range(B):
lis.append(C)
A.sort()
d = deque(A)
lis.sort(reverse=True)
l = len(lis)
for i in range(l):
if d[0] < lis[i]:
d.popleft()
d.append(lis[i])
print((sum(d)))
| import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
dic = {}
for a in A:
if a in dic:
dic[a] += 1
else:
dic[a] = 1
for _ in range(M):
B, C = list(map(int, input().split()))
if C in dic:
dic[C] += B
else:
dic[C] = B
dic = list([list(x) for x in sorted(list(dic.items()), reverse=True)])
i = 0
ans = 0
for _ in range(N):
ans += dic[i][0]
dic[i][1] -= 1
if dic[i][1] == 0:
i += 1
print(ans) | p03038 |
import heapq
nm = list([int(x) for x in input().split()])
n = nm[0]
m = nm[1]
a = list([int(x) for x in input().split()])
bc = [list([int(x) for x in input().split()]) for i in range(m)]
head_a = []
for a_item in a:
heapq.heappush(head_a, a_item)
# そーと
bc.sort(key=lambda x: x[1])
bc = list(reversed(bc))
for bc_item in bc:
for i in range(bc_item[0]):
head_a_item = heapq.heappop(head_a)
heapq.heappush(head_a, max(head_a_item, bc_item[1]))
print((sum(head_a))) | import heapq
nm = list([int(x) for x in input().split()])
n = nm[0]
m = nm[1]
a = list([int(x) for x in input().split()])
bc = [list([int(x) for x in input().split()]) for i in range(m)]
head_a = []
for a_item in a:
heapq.heappush(head_a, a_item)
# そーと
bc.sort(key=lambda x: x[1])
bc = list(reversed(bc))
for bc_item in bc:
done = False
for i in range(bc_item[0]):
head_a_item = heapq.heappop(head_a)
if (head_a_item >= bc_item[1]):
heapq.heappush(head_a, max(head_a_item, bc_item[1]))
done = True
break
else:
heapq.heappush(head_a, max(head_a_item, bc_item[1]))
if (done):
break
print((sum(head_a))) | p03038 |
N,M=list(map(int,input().split()))
A=[int(i) for i in (input().split(" "))]
BC = [list(map(int,input().split())) for _ in range(M)]
for b,c in BC:
count=0
A.sort()
for i in range(b):
if c<A[i]:
break
else:
A[i]=c
suma=0
#for i in A:
# suma+=i
print((sum(A))) |
N,M=list(map(int,input().split()))
A=[int(i) for i in (input().split(" "))]
A.sort()
BC = [list(map(int,input().split())) for _ in range(M)]
BC.sort(key=lambda x:x[1],reverse=True)
for b,c in BC:
A.extend([c]*b)
if len(A)>2*N:
break
A.sort(reverse=True)
suma=0
#for i in A:
# suma+=i
print((sum(A[:N]))) | p03038 |
#!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
A = sorted(A)
bc = sorted([(b, c) for (b, c) in zip(B, C)],
key=lambda x: x[1],
reverse=True)
D = []
for b, c in bc:
D.extend([c] * b)
r = 0
while A[r] < D[r]:
r += 1
if r >= min(len(D), len(A)):
break
print((sum(A[r:]) + sum(D[:r])))
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
from itertools import chain
class BinarySearcher(object):
def __init__(self, condition, initial_values):
self.condition = condition
self.initial_values = initial_values
# all True
if self.condition(initial_values[0]):
self.first_solution = 0
# all False
elif not self.condition(initial_values[1]):
self.first_solution = None
else:
self.first_solution = self.search_first_solution(
*self.initial_values)
def search_first_solution(self, lower, upper):
if upper - lower <= 1:
return condition(n)
n = (lower + upper) // 2
if self.condition(n):
if not self.condition(n - 1):
return n
return self.search_first_solution(lower, n)
else:
return self.search_first_solution(n, upper)
def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]"):
A = sorted(A)
bc = sorted(zip(B, C), key=lambda x: x[1], reverse=True)
D = []
for b, c in bc:
D.extend([c] * b)
if len(D) >= N:
break
length = min(len(A), len(D))
r = BinarySearcher(lambda x: A[x] > D[x], (0, length - 1)).first_solution
if r is None:
r = length
print((sum(A[r:]) + sum(D[:r])))
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
C = [int()] * (M) # type: "List[int]"
for i in range(M):
B[i] = int(next(tokens))
C[i] = int(next(tokens))
solve(N, M, A, B, C)
if __name__ == '__main__':
main()
| p03038 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
BC = [list(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)
D = []
for B, C in BC:
D += [C] * B
A+=D
A.sort(reverse = True)
print((sum(A[:N]))) | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
BC = [list(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)
D = []
sum_B=0
for B, C in BC:
D += [C] * B
sum_B += B
if sum_B>N:
break
A+=D
A.sort(reverse = True)
print((sum(A[:N]))) | p03038 |
N, M=list(map(int, input().split()))
a=list(map(int, input().split()))
k=sorted(a)
for i in range(M):
b, c=list(map(int, input().split()))
if c>k[0]:
for j in range(b):
if c-k[j]>0:
k[j]=c
else:
break
k.sort()
print((sum(k))) | N, M=list(map(int, input().split()))
a=list(map(int, input().split()))
a.sort()
card=[]
for i in range(M):
b, c=list(map(int, input().split()))
card.append((c, b))
card.sort(reverse=True)
k=0
for c, b in card:
while k < N and b > 0:
if a[k]<c:
a[k]=c
b-=1
k+=1
print((sum(a))) | p03038 |
N, M=list(map(int, input().split()))
a=list(map(int, input().split()))
a.sort()
card=[]
for i in range(M):
b, c=list(map(int, input().split()))
card.append((c, b))
card.sort(reverse=True)
k=0
for c, b in card:
while k < N and b > 0:
if a[k]<c:
a[k]=c
b-=1
k+=1
print((sum(a))) | n, m=list(map(int, input().split()))
a=list(map(int, input().split()))
a.sort()
change=[]
for i in range(m):
b, c=list(map(int, input().split()))
change.append((c, b))
change.sort(reverse=True)
elem=0
for c, b in change:
while elem<n and b>0:
if a[elem]<c:
a[elem]=c
b-=1
elem+=1
print((sum(a))) | p03038 |
import sys
N, M = list(map(int, input().split()))
A = list(map(int, sys.stdin.readline().rsplit()))
A.sort()
C = []
for _ in range(M):
b, c = list(map(int, input().split()))
C.extend([c] * b)
C.sort(reverse=True)
res = 0
for i in range(N):
if i < len(C):
if A[i] < C[i]:
res += C[i]
else:
res += A[i]
else:
res += A[i]
print(res)
| import sys
N, M = list(map(int, input().split()))
A = list(map(int, sys.stdin.readline().rsplit()))
BC = [list(map(int, sys.stdin.readline().rsplit())) for _ in range(M)]
A.sort()
BC.sort(reverse=True, key=lambda x: x[1])
C = []
for b, c in BC:
if len(C) >= N:
break
for _ in range(b):
C.append(c)
C.sort(reverse=True)
res = 0
lenC = len(C)
for i in range(N):
if i < lenC and A[i] < C[i]:
res += C[i]
else:
res += A[i]
print(res)
| p03038 |
x,y= list(map(int, input().split()))
a = list(map(int, input().split()))
b=[]
for _ in range(y):
b.append(list(map(int, input().split())))
b.sort(key = lambda x: x[1],reverse=True)
for l in b:
a.extend([l[1]]*l[0])
a.sort(reverse=True)
print((sum(a[:x])))
| x,y= list(map(int, input().split()))
a = list(map(int, input().split()))
#print(a)
b=[]
for _ in range(y):
b.append(list(map(int, input().split())))
b.sort(key = lambda x: x[1],reverse=True)
for l in b:
if(len(a)<=x*2):
a.extend([l[1]]*l[0])
#print(len(a))
#print(a)
a.sort(reverse=True)
print((sum(a[:x])))
| p03038 |
import heapq
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
heapq.heapify(A)
bc=[]
for i in range(M):
bc.append(list(map(int,input().split())))
for i in range(M):
for j in range(bc[i][0]):
if A[0]<bc[i][1]:
heapq.heappop(A)
heapq.heappush(A,bc[i][1])
else:
break
print((sum(A))) | N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
bc=[]
for i in range(M):
bc.append(list(map(int,input().split())))
bc.sort(key=lambda x:x[1],reverse=True)
nbc=[0]*N
inde=0
for i in range(M):
for j in range(bc[i][0]):
if inde<=N-1:
nbc[inde]=bc[i][1]
inde+=1
if inde==N:
break
if inde==N:
break
ind=N
for i in range(N):
if A[i]>=nbc[i]:
ind=i
break
print((sum(nbc[:ind])+sum(A[ind:]))) | p03038 |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
bc = sorted([list(map(int, input().split())) for i in range(m)], key =lambda x:x[1])
t = True
cnt = 0
while t == True and cnt < len(bc):
cnt += 1
num = bc[-cnt][0]
large = bc[-cnt][1]
if large > min(a):
for i in a:
if i < large and a.index(i)+1 <= num:
a[a.index(i)] = large
else:
break
a.sort()
else:
t = False
print((sum(a))) | n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
bc = sorted([list(map(int, input().split())) for i in range(m)], key =lambda x:x[1])
bc.reverse()
flg = 0
cnt = 0
for i in range(n):
if bc[flg][1] >a[i] and flg < m:
a[i] = bc[flg][1]
cnt +=1
if cnt == bc[flg][0]:
flg += 1
cnt = 0
if flg == m:
break
else:
break
print((sum(a))) | p03038 |
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
bc = sorted([list(map(int, input().split())) for i in range(m)], key =lambda x:x[1])
bc.reverse()
flg = 0
cnt = 0
for i in range(n):
if bc[flg][1] >a[i] and flg < m:
a[i] = bc[flg][1]
cnt +=1
if cnt == bc[flg][0]:
flg += 1
cnt = 0
if flg == m:
break
else:
break
print((sum(a))) | n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
bc = sorted([list(map(int, input().split())) for i in range(m)], key =lambda x:x[1])
bc.reverse()
flg = 0
cnt = 0
for i in range(n):
if flg < m and bc[flg][1] >a[i]:
a[i] = bc[flg][1]
cnt +=1
if cnt == bc[flg][0]:
flg += 1
cnt = 0
else:
break
print((sum(a))) | p03038 |
import sys
import heapq
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n, m = inm()
a = inl()
def solve():
heapq.heapify(a)
for i in range(m):
b, c = inm()
for j in range(b):
if a[0] >= c:
break
heapq.heappush(a, c)
heapq.heappop(a)
return sum(a)
print(solve())
| import sys
import heapq
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n, m = inm()
a = inl()
def solve():
g = []
for i in range(m):
b, c = inm()
g.append((c, b))
g.sort(reverse=True)
h = []
for c, b in g:
if len(h) == n:
break
for i in range(b):
h.append(c)
if len(h) == n:
break
assert len(h) <= n
heapq.heapify(a)
for x in h:
if a[0] >= x:
break
heapq.heappush(a, x)
heapq.heappop(a)
return sum(a)
print(solve())
| p03038 |
n, m = list(map(int, input().split()))
cards = sorted(list(map(int, input().split())))
ope = [list(map(int, input().split())) for i in range(m)]
ope.sort(key=lambda x: x[1], reverse=True)
i, j, k = 0, 0, 0
while i < n and j < m and cards[i] < ope[j][1]:
cards[i] = ope[j][1]
i += 1
k += 1
if k >= ope[j][0]:
j += 1
k = 0
print((sum(cards))) | n, m = list(map(int, input().split()))
a = sorted([int(i) for i in input().split()])
bc = sorted([tuple(map(int, input().split())) for i in range(m)], key=lambda x: x[1], reverse=True)
i = 0
for b, c in bc:
while b:
if i < n and a[i] < c:
a[i] = c
b -= 1
else:
break
i += 1
print((sum(a))) | p03038 |
from functools import cmp_to_key
n, m = list(map(int, input().split()))
a = [int(e) for e in input().split()]
bc = [[int(e) for e in input().split()] for _ in range(m)]
bc.sort(key = cmp_to_key(lambda x, y: y[1] - x[1]))
t = 0
for b, c in bc:
a.extend([c] * b)
t += b
if t > n:
break
a.sort(reverse = True)
print((sum(a[:n])))
| n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc.sort(key = lambda x: x[1], reverse = True)
t = 0
for b, c in bc:
a.extend([c] * b)
t += b
if t > n:
break
a.sort(reverse = True)
print((sum(a[:n]))) | p03038 |
# D - Integer Cards
# https://atcoder.jp/contests/abc127/tasks/abc127_d
import sys
n, m = list(map(int, sys.stdin.readline().split()))
cards = list(map(int, sys.stdin.readline().split()))
cards.sort()
set = [list(map(int, sys.stdin.readline().split())) for _ in range(m)]
# combinations.sort(key = lambda x: x[1], reverse = True)
combinations = []
for b, c in set:
combinations.extend([c] * b)
combinations.sort(reverse = True)
ans = 0
left = 0
for i in range(len(combinations)):
if i > len(cards) or combinations[i] <= cards[i]:
break
else:
ans += combinations[i]
left += 1
print((ans + sum(cards[left:]))) | # D - Integer Cards
# https://atcoder.jp/contests/abc127/tasks/abc127_d
import sys
n, m = list(map(int, sys.stdin.readline().split()))
cards = list(map(int, sys.stdin.readline().split()))
combinations = [list(map(int, sys.stdin.readline().split())) for _ in range(m)]
cards.sort()
combinations.sort(key=lambda x: x[1], reverse=True)
i = 0
for b, c in combinations:
for k in range(i, min(n, i + b)):
if cards[k] < c:
cards[k] = c
i += 1
else:
break
print((sum(cards)))
| p03038 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.