n, c = map(int, input().split())
p = sorted((int(input()) for _ in range(n)), reverse=True)
tot = sum(p)
c1 = []
c2 = []
for _ in range(c):
    t, x = map(int, input().split())
    if t == 1:
        c1.append(x)
    else:
        c2.append(x)
c1.sort(reverse=True)
c2.sort(reverse=True)
s1 = len(c1)
s2 = len(c2)
INF = 10 ** 18
dp = [-INF] * (s1 + 1)
dp[0] = 0
for i, pi in enumerate(p):
    ndp = dp[:]
    for j in range(i + 1):
        # used j coupons in c1
        k = i - j
        if not (0 <= j <= s1 and 0 <= k <= s2):
            continue
        if j < s1:
            ndp[j+1] = max(ndp[j+1], dp[j] + min(c1[j], pi))
        if k < s2:
            ndp[j] = max(ndp[j], dp[j] + pi * c2[k] // 100)
    dp = ndp
ans = tot - max(dp)
print(ans)