import sys
readline = sys.stdin.readline

N, C = map(int, readline().split())
P = [0] * N
for i in range(N):
    P[i] = int(readline())

X1, X2 = [], []
for i in range(C):
    T, X = map(int, readline().split())
    if T == 1:
        X1.append(X)
    else:
        X2.append(X)

C1, C2 = len(X1), len(X2)
X1.sort(reverse=True)
X2.sort(reverse=True)
P.sort(reverse=True)
inf = 10 ** 18
pre = [-inf] * (C + 1)
pre[0] = 0
for i in range(min(N, C)):
    dp = [-inf] * (C + 1)
    for j in range(C1):
        dp[j + 1] = max(dp[j + 1], pre[j] + min(P[i], X1[j]))
        j2 = i - j
        if j2 >= C2 or j2 < 0:
            continue
        dp[j] = max(dp[j], pre[j] + P[i]//100 * X2[j2])
    dp, pre = pre, dp

print(sum(P) - max(pre))