Greater = Proc.new {|a, b| b <=> a}

Infinity = 1e+9.to_i

def main(argv)
  (n, c) = gets.chomp.split(' ').map(&:to_i)

  ps = [0] * n
  n.times{|i| ps[i] = gets.chomp.to_i}
  ps.sort!(&Greater)
  total = ps.reduce(:+)

  cs1 = []
  cs2 = []
  c.times do |j|
    cc = gets.chomp.split(' ').map(&:to_i)
    if cc[0] == 1 then
      cs1.push(cc[1])
    else # cc[0] == 2
      cs2.push(cc[1])
    end
  end
  cs1.sort!(&Greater)
  cs2.sort!(&Greater)

  (c1, c2) = [cs1.size, cs2.size]

  dp = [nil] * (n + 1)
  (n + 1).times{|i| dp[i] = [Infinity] * (c1 + 1)}
  dp[0][0] = 0

  n.times do |i|
    if i < c then
      (c1 + 1).times do |j|
        next if j > i
        k = i - j

        dp[i + 1][j] = [dp[i + 1][j], dp[i][j] + ps[i]].min

        if j < c1 then
          new_cost_1 = [ps[i] - cs1[j], 0].max
          dp[i + 1][j + 1] = [dp[i + 1][j + 1], dp[i][j] + new_cost_1].min
        end

        if k < c2 then
          new_cost_2 = ps[i] - ((ps[i] / 100) * cs2[k])
          dp[i + 1][j + 0] = [dp[i + 1][j + 0], dp[i][j] + new_cost_2].min
        end
      end
    else
      (c1 + 1).times do |j|
        dp[i + 1][j] = [dp[i + 1][j], dp[i][j] + ps[i]].min
      end
    end
  end

  puts dp[n].min.to_s
end

main(ARGV) if self.to_s == 'main'