#ifdef LOCAL
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#else
#include <bits/stdc++.h>
#endif
using namespace std ;

typedef long long ll ;
typedef unsigned long long ull ;
#define rep(i , n ) for ( int i =0; i < n ; i++)
#define rrep(i , n) for ( int i = n-1; i >=0 ; i--)

#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;

class UnionFind {
private:
	ull size_; 
	std::vector<ull> par, rank, count;

public:
	UnionFind() : size_(0), par(std::vector<ull>()), rank(std::vector<ull>()), count(std::vector<ull>()) {};
	UnionFind(ull size__) : size_(size__) {
		par.resize(size_); rank.resize(size_); count.resize(size__);
		for (ull i = 0; i < size_; i++) par[i] = i, rank[i] = 0, count[i] = 1;
	}
	ull size() { return size_; }
	// ull root(ull x) { return par[x] == x ? x : par[x] = root(par[x]); }
	
	ull root(ull x)
	{
		while(par[x] != x)
		{
			par[x] = par[par[x]];
			x = par[x];
		}
		return x;
	}
	
	bool same(ull x, ull y) { return root(x) == root(y); }

	void unite(ull x, ull y) {
		x = root(x), y = root(y);
		if (x == y) return;
		if (rank[x] < rank[y]) par[x] = y, count[y]+=count[x], count[x]=0;
		else if (rank[x] == rank[y]) par[y] = x, rank[x]++, count[x]+=count[y], count[y]=0;
		else par[y] = x, count[x] += count[y], count[y] = 0;
	}

	ull size__(ull x)
	{
		return count[root(x)];
	}

	bool operator==(const UnionFind &u) { return par == u.par; }
	bool operator!=(const UnionFind &u) { return par != u.par; }
};
/*
maybe sth wrong 
got wa in one problem
*/
ll modpow(ll a, ll b)
{
	if (b == 0)
	{
		return 1;
	}

	if (b % 2)
	{
		return a * modpow(a, b-1) % MOD;
	}
	else
	{
		ll halfB = b / 2;
		ll half = modpow(a, halfB);
		return half * half % MOD;
	}
}

ll calcComb(ll n, ll m)
{
	if (m > n-m)
	{
		return calcComb(n, n-m);
	}

	ll ansMul = 1;
	ll ansDiv = 1;

	rep(i, m)
	{
		ansMul *= (n-i);
		ansDiv *= (i+1);
		ansMul %= MOD;
		ansDiv %= MOD;
	}

	return ansMul * modpow(ansDiv, MOD - 2) % MOD;
}

__attribute__((constructor))
void initial()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);
}
struct A
{
	ll times;
	ll value;
	bool operator<(A other) const
    {
        return value < other.value;
    }

};

int main()
{
	int N, M;
	
	cin >> N >> M;
	
	#if 0
	// TLE 3 cases
	priority_queue <ll,vector<ll>, greater<ll> > pq; 
	
	rep(i, N)
	{
		ll a;
		cin >> a;
		pq.push(a);
	}

	rep(i, M)
	{
		ll b, c;
		cin >> b >> c;
		rep(j, b)
		{
			if (pq.top() < c)
			{
				pq.pop();
				pq.push(c);
			}
			else
			{
				break;
			}
		}
	}
	ll total = 0;
	while(!pq.empty())
	{
		total += pq.top();
		pq.pop();
	}
	#endif
	map<ll, struct A> m;
	rep(i, N)
	{
		ll a;

		cin >> a;
		if (m.find(a) != m.end())
		{
			m[a].times++;
		}
		else
		{
			struct A tmp;
			tmp.times = 1;
			tmp.value = a;
			m[a] = tmp;
		}
		
	}

	rep(i, M)
	{
		ll b, c;
		cin >> b >> c;
		if (m.find(c) != m.end())
		{
			m[c].times+=b;
		}
		else
		{
			struct A tmp;
			tmp.times = b;
			tmp.value = c;
			m[c] = tmp;
		}
	}

	ll total = 0;
	map<ll, struct A>::reverse_iterator it = m.rbegin();
	ll total_time = 0;
	for (; it != m.rend(); it++)
	{
		ll tmp_time = total_time + it->second.times;
		if (tmp_time >= N)
		{
			total += (it->second.value) * (N - total_time);
			break;
		}
		else
		{
			total += (it->second.value) * it->second.times;
			total_time = tmp_time;
		}
	}

	//cout << total << endl;

	cout << total << endl;
	return 0;
}


Measured memory_bytes: 14592