#define _CRT_SECURE_NO_WARNINGS

#include "bits/stdc++.h"
#ifdef _MSC_VER
int getchar_unlocked() { return getchar(); }
#endif
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
#define qp(f) [](auto i){return f;}
using LL=long long;
using VI=vector<int>;
using VL=vector<LL>;
using VS=vector<string>;
using VVI=vector<vector<int>>;
using PII=pair<int, int>;
const int inf = (int)1e9;
const LL MOD = 1000000007;
const double pi = acos(-1.0);
const string Snum = "0123456789";
const int dx[] = { -1,0,1,0 }, dy[] = { 0,1,0,-1 };
template<class T>T Sort(T& a) { sort(a.begin(), a.end()); return a; }
template<class T>T ReSort(T& a) { sort(a.rbegin(), a.rend()); return a; }
template<class T>T Reverse(T& a) { reverse(a.begin(), a.end()); return a; }
template<class T>void Unique(T& a) { a.erase(unique(a.begin(), a.end()), a.end()); }
template<class T>auto Max(T a) { return *max_element(a.begin(), a.end()); }
template<class T>auto Min(T a) { return *min_element(a.begin(), a.end()); }
template<class T, class U>int Count(T a, U c) { return count(a.begin(), a.end(), c); }
template<class T, class U>U Sum(T a, U init = 0) { return accumulate(a.begin(), a.end(), init); }
template<class T>T Age(T a, T b) { return (a + b - 1) / b; }
template<class T>T gcd(T n, T m) { return m == 0 ? n : gcd(m, n % m); }
template<class T>T lcm(T n, T m) { return n / gcd(n, m) * m; }

/* RANGE */
namespace RangeNameSpace {
	template<class T>class Range {
		const T start_, stop_, step_;
	public:
		Range(const T& start, const T& stop, const T& step) : start_{ start }, stop_{ stop }, step_{ step } {assert(!(step_ == 0 || (start_ > stop_ && step_ > 0) || (start_ < stop_ && step_ < 0))); }
		class iterator {
			T value_; const T start_, stop_, step_;
		public:
			using value_type = T;
			iterator(T value, T step, T start, T stop) : value_{ value }, step_{ step }, start_{ start }, stop_{ stop } {}
			iterator operator++() { value_ = std::min(std::max(start_, stop_), std::max(std::min(start_, stop_), value_ + step_)); return *this; }
			iterator operator--() { value_ = std::min(std::max(start_, stop_), std::max(std::min(start_, stop_), value_ - step_)); return *this; }
			T& operator*() { return value_; }
			const T* operator->() { return &value_; }
			bool operator==(const iterator& rhs) { return value_ == rhs.value_; }bool operator!=(const iterator& rhs) { return value_ != rhs.value_; }
		};
		T operator[](size_t i) { return start_ + i * step_; }
		size_t size() { return (max(stop_, start_) - min(stop_, start_)) / abs(step_); }
		iterator begin() const { return iterator(start_, step_, start_, stop_); }
		iterator end() const { return iterator(stop_, step_, start_, stop_); }
		explicit operator vector<T>() const { vector<T>t; for (T i = start_; i < stop_; i += step_)t.push_back(i); return t; }
	};

	template <class T, class Func, class FuncType>class Range2 {
		using Itr = class T::iterator; Itr begin_, end_; Func f_;
	public:
		Range2(T v, Func f) : begin_{ v.begin() }, end_{ v.end() }, f_{ f } {}
		class iterator {
		public:
			typedef forward_iterator_tag iterator_category; iterator(Itr itr, Func f) : itr_{ itr }, f_{ f } {}
			iterator operator++() { ++itr_; return *this; }
			iterator operator--() { --itr_; return *this; }
			FuncType operator*() { return f_(*itr_); }
			bool operator==(iterator rhs) { return rhs.itr_ == itr_; }bool operator!=(iterator rhs) { return rhs.itr_ != itr_; }
		private:Itr itr_; Func f_;
		};
		size_t size() { return begin_.size(); }
		iterator begin() const { return iterator(begin_, f_); }
		iterator end() const { return iterator(end_, f_); }
		operator vector<FuncType>() const { vector<FuncType>t; for (Itr i = begin_; i != end_; ++i)t.push_back(f_(*i)); return t; }
	};

}
template<class T> RangeNameSpace::Range<T> range(const T& stop) { return RangeNameSpace::Range<T>(T{ 0 }, stop, T{ 1 }); }
template<class T> RangeNameSpace::Range<T> range(const T& start, const T& stop) { return RangeNameSpace::Range<T>(start, stop, T{ 1 }); }
template<class T> RangeNameSpace::Range<T> range(const T& start, const T& stop, const T& step) { return RangeNameSpace::Range<T>(start, stop, step); }
template<class _T> ostream& operator << (ostream& ostr, const vector<_T>& v) { if (v.size() == 0) { ostr << ""; return ostr; }ostr << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++)ostr << " " << *itr; return ostr; }
template<class T> ostream& operator << (ostream& ostr, const RangeNameSpace::Range<T>& r) { ostr << vector<T>(r); return ostr; }
template<class T, class Func, class FuncType> ostream& operator << (ostream& ostr, const RangeNameSpace::Range2<T, Func, FuncType>& r) { ostr << vector<FuncType>(r); return ostr; }
template<class T, class Func> auto operator | (T v, Func f) { RangeNameSpace::Range2<T, Func, decltype(f(*v.begin()))>r(v, f); return r; }

/* INPUT */
struct inputter_Str {
	vector<string> inputbuffer;
	string operator [](int n) {
		while (inputbuffer.size() <= n) {
			string s; //cin >> s;
			char c = getchar_unlocked();
			while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
				s.push_back(c);
				c = getchar_unlocked();
			}inputbuffer.push_back(s);
		}
		return inputbuffer[n];
	}
	operator string() {
		string s;
		char c = getchar_unlocked();
		while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
			s.push_back(c);
			c = getchar_unlocked();
		}inputbuffer.push_back(s);
		return s;
	}
}in;
struct inputter_Int {
	int operator [](int n) {
		//string s; //cin >> s;
		return stoi(in[n]);
	}
	operator int() { return stoi(string(in)); }
}ini;
struct inputter_LL {
	long long operator [](int n) { return stoll(in[n]); }
	operator long long() { return stoll(string(in)); }
}inl;
struct inputter_Double {
	double operator [](int n) { return stod(in[n]); }
	operator double() { return stold(string(in)); }
}ind;
vector<int>       invi(int n, int m) { vector<int> v(m); for (int i = 0; i < m; ++i)v[i] = ini[n + i]; return v; }
vector<long long> invl(int n, int m) { vector<long long> v(m); for (int i = 0; i < m; ++i)v[i] = inl[n + i]; return v; }
vector<string>    invs(int n, int m) { vector<string> v(m); for (int i = 0; i < m; ++i)v[i] = in[n + i]; return v; }
int Suminvi(int n, int m) { return Sum(invi(n, m), 0); }long long Suminvl(int n, int m) { return Sum(invl(n, m), 0LL); }
int Maxinvi(int n, int m) { return Max(invi(n, m)); }   long long Maxinvl(int n, int m) { return Max(invl(n, m)); }
int Mininvi(int n, int m) { return Min(invi(n, m)); }   long long Mininvl(int n, int m) { return Min(invl(n, m)); }

struct inputter_Int_Fast {
	int get() {
		int num = 0;
		bool neg = false;
		char c = getchar_unlocked();
		if (c == '-') {
			neg = true;
			c = getchar_unlocked();
		}
		while ('0' <= c && c <= '57') {
			num = num * 10 + (c - '0');
			c = getchar_unlocked();
		}
		return neg ? -num : num;
	}
	operator int() { return get(); }
}inif;
struct inputter_LL_Fast {
	int get() {
		LL num = 0;
		bool neg = false;
		char c = getchar_unlocked();
		if (c == '-') {
			neg = true;
			c = getchar_unlocked();
		}
		while ('0' <= c && c <= '57') {
			num = num * 10LL + LL(c - '0');
			c = getchar_unlocked();
		}
		return neg ? -num : num;
	}
	operator LL() { return get(); }
}inlf;
vector<int>invif(int n) {
	vector<int> v(n);
	for (int i = 0; i < n; ++i) {

		int num = 0;
		bool neg = false;
		char c = getchar_unlocked();
		if (c == '-') {
			neg = true;
			c = getchar_unlocked();
		}
		while ('0' <= c && c <= '57') {
			num = num * 10 + (c - '0');
			c = getchar_unlocked();
		}
		v[i] = neg ? -num : num;
	}
	return v;
}
vector<LL>invlf(int n) {
	vector<LL> v(n);
	for (int i = 0; i < n; ++i) {
		LL num = 0;
		bool neg = false;
		char c = getchar_unlocked();
		if (c == '-') {
			neg = true;
			c = getchar_unlocked();
		}
		while ('0' <= c && c <= '57') {
			num = num * 10LL + LL(c - '0');
			c = getchar_unlocked();
		}
		v[i] = neg ? -num : num;
	}
	return v;
}

ostream& operator << (ostream& ostr, inputter_Str i) { ostr << string(i); return ostr; }

/* OUTPUT */
struct boolswitch { string t, f; boolswitch(string tr, string fa) :t(tr), f(fa) {} }yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct divizer { string s; divizer(string s_) :s(s_) {} }spc(" "), nosp(""), comma(",");
struct outputter {
	bool flag = false; boolswitch bs; divizer di;
	outputter(bool f, boolswitch b, divizer d) :flag(f), bs(b), di(d) {}
	template<class T>outputter operator ,(T o) {
		if (flag)cout << di.s; cout << o;
		outputter t(true, bs, di); return t;
	}
	outputter operator ,(double o) {
		if (flag)cout << di.s; printf("%.20f", o);
		outputter t(true, bs, di); return t;
	}
	outputter operator ,(bool o) {
		if (flag)cout << di.s; cout << (o ? bs.t : bs.f);
		outputter t(true, bs, di); return t;
	}
	template<class T> outputter operator ,(vector<T> o) {
		if (flag)cout << di.s;
		for (int i = 0; i < (int)o.size(); ++i)cout << o[i] << (i == (int)o.size() - 1 ? "" : di.s);
		outputter t(true, bs, di); return t;
	}
	template<class T, class U> outputter operator ,(pair<T, U> o) {
		if (flag)cout << di.s;
		cout << "[" << o.first, ", " << o.second << "]";
		outputter t(true, bs, di); return t;
	}
	outputter operator ,(outputter o) { cout << '\n'; return o; }
	outputter operator ,(boolswitch b) { outputter t(flag, b, di); return t; }
	outputter operator ,(divizer d) { outputter t(flag, bs, d); return t; }
}out(false, Yes, spc);

/* ANSWER */
struct Answer {
	int       mini = INT_MAX, maxi = INT_MIN, sumi = 0;
	long long minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0LL;
	double    mind = DBL_MAX, maxd = DBL_MIN, sumd = 0.;
	int count = 0;
	void operator =(int n) { mini = min(mini, n); maxi = max(maxi, n); sumi += n; count++; }
	void operator =(long long n) { minl = min(minl, n); maxl = max(maxl, n); suml += n; count++; }
	void operator =(double n) { mind = min(mind, n); maxd = max(maxd, n); sumd += n; count++; }
}ans;

/* SLICE */
struct IntNone {
	int val = 0; bool none = true;
	IntNone() :val(0), none(true) {};
	IntNone(int v) :val(v), none(false) {};
	operator int() { return val; }
}None;
struct Slicer {
	IntNone from_, to_, step_;
	Slicer(IntNone from, IntNone to, IntNone step) :from_(from), to_(to), step_(step) {}
};
Slicer sp(int from, int to, int step = 1) { return Slicer(from, to, step); }
Slicer sp(int from, IntNone to, int step = 1) { return Slicer(from, to, step); }
Slicer sp(IntNone from, int to, int step = 1) { return Slicer(from, to, step); }
Slicer sp(IntNone from, IntNone to, int step = 1) { return Slicer(from, to, step); }
template<class T>decltype(auto) operator |(T v, Slicer s) {
	typedef typename T::iterator::value_type Ty;
	vector<Ty> ret; int size = (int)v.size();
	if (s.step_ > 0) {
		if (s.from_.none)s.from_ = 0;
		if (s.from_ < 0)s.from_ = size + s.from_;
		if (s.to_ < 0)s.to_ = size + s.to_;
	}
	else if (s.step_ < 0) {
		if (s.from_.none)s.from_ = size;
		if (s.from_ < 0)s.from_ = size + s.from_;
		if (s.to_ < 0)s.to_ = size + s.to_;
	}
	if (s.step_ > 0)
		for (int i = max(s.from_.val, 0); (s.to_.none ? true : (i < s.to_)) && i < size && i >= 0; i += s.step_)ret.push_back(v[i]);
	else for (int i = min(s.from_.val, size - 1); (s.to_.none ? true : (i > s.to_)) && i >= 0; i += s.step_)ret.push_back(v[i]);
	return ret;
}

/* MOD */
long long modpow(long long a, long long n, long long _MOD = MOD) {
	long long re = 1;
	while (n > 0) {
		if (n & 1)re = re * a % _MOD;
		a = a * a % _MOD; n >>= 1;
	}
	return re;
}
long long modinv(long long n, long long _MOD = MOD) {
	return modpow(n, _MOD - 2, _MOD);
}
struct Modl {
	long long val = 0;
	Modl(long long v = 0)noexcept :val(v% MOD) { if (val < 0)v += MOD; }
	operator long long() { return val; }
};
Modl operator-(const Modl& a) { Modl r; r.val = a.val ? MOD - a.val : 0; return r; }
Modl operator+(const Modl& a, const Modl& b) { Modl r(a.val + b.val); return r; }
Modl operator-(const Modl& a, const Modl& b) { Modl r(a.val - b.val); return r; }
Modl operator*(const Modl& a, const Modl& b) { Modl r(a.val * b.val); return r; }
Modl operator/(const Modl& a, const Modl& b) { Modl r(a.val * modinv(b.val, MOD)); return r; }
Modl operator+(const Modl& a, const int& b) { Modl r(a.val + LL(b)); return r; }
Modl operator-(const Modl& a, const int& b) { Modl r(a.val - LL(b)); return r; }
Modl operator*(const Modl& a, const int& b) { Modl r(a.val * LL(b)); return r; }
Modl operator/(const Modl& a, const int& b) { Modl r(a.val * modinv(LL(b), MOD)); return r; }
Modl operator+(const Modl& a, const long long& b) { Modl r(a.val + b); return r; }
Modl operator-(const Modl& a, const long long& b) { Modl r(a.val - b); return r; }
Modl operator*(const Modl& a, const long long& b) { Modl r(a.val * b); return r; }
Modl operator/(const Modl& a, const long long& b) { Modl r(a.val * modinv(b, MOD)); return r; }
Modl operator-(const int& a, const Modl& b) { Modl r(LL(a) - b.val); return r; }
Modl operator*(const int& a, const Modl& b) { Modl r(LL(a) * b.val); return r; }
Modl operator/(const int& a, const Modl& b) { Modl r(LL(a) * modinv(b.val, MOD)); return r; }
Modl operator+(const int& a, const Modl& b) { Modl r(LL(a) + b.val); return r; }
Modl operator+(const long long& a, const Modl& b) { Modl r(a + b.val); return r; }
Modl operator-(const long long& a, const Modl& b) { Modl r(a - b.val); return r; }
Modl operator*(const long long& a, const Modl& b) { Modl r(a * b.val); return r; }
Modl operator/(const long long& a, const Modl& b) { Modl r(a * modinv(b.val, MOD)); return r; }
Modl pow(Modl a, int n) { Modl r(modpow(a, n)); return r; }
Modl pow(Modl a, long long n) { Modl r(modpow(a, n)); return r; }

/* age */
struct agel { long long val; agel(long long i) : val(i) {} };
agel operator"" age(unsigned long long i) { return agel(i); }
long long operator/(const long long& a, const agel& b) { return Age(a, b.val); }
struct ATFIRST {
	ATFIRST() {}
}ATFIRST_;

int main() {
	LL n, m; cin >> n >> m;
	VL a(n); rep(i, n)cin >> a[i];
	vector<pair<LL, LL>> bc(m);
	rep(i, m) {
		int n1, n2; cin >> n1 >> n2;
		bc[i] = mp(n2, n1);
	}

	Sort(a);
	ReSort(bc);

	int pos = 0;
	rep(i, n) {
		if (a[i] >= bc[pos].first)break;

		a[i] = bc[pos].first;
		if (bc[pos].second == 1) {
			if (pos == m - 1)break;
			else pos++;
		}
		else {
			bc[pos].second--;
		}
	}
	out, Sum(a, 0LL), out;
}

Measured memory_bytes: 4208