n, c = map(int, input().split())
prices = [int(input()) for _ in range(n)]
coupons = [tuple(map(int, input().split())) for _ in range(c)]

sum_p = sum(prices)

savings_list = []

for i in range(n):
    pi = prices[i]
    for j in range(c):
        t, x = coupons[j]
        if t == 1:
            discounted = max(pi - x, 0)
            save = pi - discounted
        else:
            discounted = (pi * (100 - x)) // 100
            save = pi - discounted
        if save > 0:
            savings_list.append((-save, i, j))  # Using negative for sorting in reverse order

savings_list.sort()

product_used = [False] * n
coupon_used = [False] * c
total_saving = 0

for save_neg, i, j in savings_list:
    save = -save_neg
    if not product_used[i] and not coupon_used[j]:
        total_saving += save
        product_used[i] = True
        coupon_used[j] = True

print(sum_p - total_saving)