import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readS(T)(size_t n,ref T t){t=new T(n);foreach(ref v;t){auto r=rdsp;foreach(ref j;v.tupleof)pick(r,j);}}

void main()
{
  int n, m; readV(n, m);
  int[] a; readA(n, a);
  struct D { int b, c; }
  D[] d; readS(m, d);

  a.sort();
  d.sort!"a.c>b.c";

  auto i = 0;
 loop: foreach (di; d) {
    foreach (j; 0..di.b) {
      if (a[i] < di.c)
	a[i++] = di.c;
      if (i >= n) break loop;
    }
  }

  writeln(a.to!(long[]).sum);
}
