import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n, c = LI()
pp = [II() for _ in range(n)]
t1, t2 = [], []
for _ in range(c):
    t, x = LI()
    if t == 1: t1.append(x)
    else: t2.append(x)

pp.sort(reverse=True)
t1.sort(reverse=True)
t2.sort(reverse=True)

ans=0
for _ in range(n-c):
    ans+=pp.pop()

def chmin(i,j,val):
    if val<dp[i][j]:dp[i][j]=val

# dp[j]...t1をj枚使った時の最小金額
dp=[[inf]*(len(t1)+1) for _ in range(len(pp)+1)]
dp[0][0]=0
for i,p in enumerate(pp):
    for j in range(min(i,len(t1)),-1,-1):
        pre=dp[i][j]
        # print(i,j)
        if t1 and j<len(t1):chmin(i+1,j+1,pre+max(0,p-t1[j]))
        if t2 and i-j<len(t2):chmin(i+1,j,pre+(100-t2[i-j])*p//100)
# p2D(dp)

print(ans+min(dp[-1]))