import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto M = RD;
	auto A = RDR.ARR;
	A.sort();
	
	auto BC = new long[2][](M);
	foreach (i; 0..M)
	{
		BC[i] = [RD, RD];
	}
	BC.sort!((long[2] a, long[2] b) => a[1] > b[1])();
	
	debug writeln(A);
	long ans;
	long pos;
	long cnt;
	foreach (i; 0..N)
	{
		debug writeln(pos, " ", cnt, " ", ans);
		if (pos == M)
		{
			ans += A[i];
			continue;
		}

		if (cnt >= BC[pos][0])
		{
			++pos;
			cnt = 0;
			if (pos == M)
			{
				ans += A[i];
				continue;
			}
		}

		if (A[i] < BC[pos][1])
		{
			ans += BC[pos][1];
			++cnt;
		}
		else
		{
			ans += A[i];
			++pos;
			cnt = 0;
		}
	}
	debug writeln(ans);

	/*long ans;
	long lenMax;
	foreach_reverse (i; 0..M)
	{
		auto b = BC[i][0];
		auto c = BC[i][1];
		ans += c * max(0, b - lenMax);
		debug writeln(ans);
		lenMax = max(lenMax, b);
	}

	foreach (i; lenMax..N)
	{
		ans += A[i];
		debug writeln(ans);
	}*/

	writeln(ans);
	stdout.flush();
	debug readln();
}