import sys
input = sys.stdin.readline

N, C = map(int, input().split())
P = [int(input()) for _ in range(N)]
P.sort(reverse=True)
X1, X2 = [], []

for _ in range(C):
    T, X = map(int, input().split())
    
    if T==1:
        X1.append(X)
    else:
        X2.append(X)

X1.sort(reverse=True)
X2.sort(reverse=True)
n, m = len(X1), len(X2)
dp = [[0]*(m+1) for _ in range(n+1)]

for i in range(n+1):
    for j in range(m+1):
        if i+j<N:
            p = P[i+j]
        
            if i+1<=n:
                dp[i+1][j] = max(dp[i+1][j], dp[i][j]+min(p, X1[i]))

            if j+1<=m:
                dp[i][j+1] = max(dp[i][j+1], dp[i][j]+p//100*X2[j])

S = sum(P)
ans = S

for i in range(n+1):
    for j in range(m+1):
        ans = min(ans, S-dp[i][j])

print(ans)