Language: C++

#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//const int INF = 1e9;//INT_MAX=1<<31-1=2147483647
const ll INF = (ll)1e18;//1<<63-1=9223372036854775807
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define pb push_back
inline bool isnatural(double a) { return a>=0 && ceil(a)==floor(a); }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

const ll N_MAX = 100000;
const ll M_MAX = 100000;
const ll C_I_MAX = 1000000000;

ll N, M;

//priority_queue<ll, vector<ll>, greater<ll> > que;
ll ans=0;
vector<ll> que,v;
void input() {
	scanf("%lld%lld", &N, &M);
	rep(i, N) {
		ll a;
		cin >>a;
		que.push_back(a);
		ans+=a;
	}
	vector<pair<ll,ll>> pa(M);
	rep(i,M){
		ll count,num;
		cin >>count>>num;
		pa[i].first=count;
		pa[i].second=num;
	}
	sort(all(pa), [](const pair<ll,ll> &x, const pair<ll,ll> &y) {
		return x.second > y.second;
	});
	rep(i,M){
		rep(j,pa[i].first){
			v.pb(pa[i].second);
			if(v.size()==N)break;

		}

	}
	//sort(all(v),greater<ll>());
}

void solve() {

	ll i=0;
	ll vsize=v.size();
	while(1){
		ll qq=que.top();
		ll vv=v[i];
		if(qq<vv){
			que.pop();
			que.push(vv);
			ans+=vv-qq;
			i++;
			if(i==vsize)break;
		}else{
			break;
		}	
	}



	/*
	while(!que.empty()){
		ll t=que.top();que.pop();
		ans+=t;
	}
	*/
	printf("%lld\n", ans);
}

signed main() {
	input();
	//solve();
	return 0;
}


Compiler output:
a.cc:2:10: fatal error: boost/multiprecision/cpp_int.hpp: No such file or directory
    2 | #include <boost/multiprecision/cpp_int.hpp>
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.