using System;
using System.Collections.Generic;
using System.Linq;

class B
{
	static int[] Read() => Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
	static (int t, int x) Read2() { var a = Read(); return (a[0], a[1]); }
	static void Main() => Console.WriteLine(Solve());
	static object Solve()
	{
		var (n, cc) = Read2();
		var ps = Array.ConvertAll(new bool[n], _ => int.Parse(Console.ReadLine()));
		var cs = Array.ConvertAll(new bool[cc], _ => Read2());

		ps = ps.OrderBy(x => -x).ToArray();
		//var q1 = new Queue<int>(cs.Where(c => c.t == 1).Select(c => c.x).OrderBy(x => -x).Take(n));
		var q2 = new Queue<int>(cs.Where(c => c.t == 2).Select(c => c.x).OrderBy(x => -x).Take(n));
		var c1 = cs.Where(c => c.t == 1).Select(c => c.x).OrderBy(x => -x).Take(n).ToArray();
		//var c2 = cs.Where(c => c.t == 2).Select(c => c.x).OrderBy(x => -x).Take(n).ToArray();

		// どの商品に定額クーポンを使うか
		var p_c1 = new int[n];

		void Push(int pi, int x)
		{
			if (pi + 1 < n && p_c1[pi] > 0)
				Push(pi + 1, p_c1[pi]);
			p_c1[pi] = x;
		}

		// 低いほうから埋める
		for (int ci = c1.Length - 1, pi = n - 1; ci >= 0; ci--)
		{
			while (pi > 0 && c1[ci] > ps[pi])
				pi--;
			Push(pi, c1[ci]);
			if (pi > 0) pi--;
		}

		var r = 0;
		for (int i = 0; i < n; i++)
		{
			var p = ps[i];
			if (p_c1[i] > 0)
			{
				if (q2.Any())
				{
					var t1 = Math.Max(0, p - p_c1[i]);
					var t2 = p - p / 100 * q2.Peek();
					if (t1 < t2)
					{
						r += t1;
					}
					else
					{
						q2.Dequeue();
						r += t2;
						if (i + 1 < n) Push(i + 1, p_c1[i]);
					}
				}
				else
					r += Math.Max(0, p - p_c1[i]);
			}
			else
			{
				if (q2.Any())
					r += p - p / 100 * q2.Dequeue();
				else
					r += p;
			}
		}

		return r;
	}
}