#include <bits/stdc++.h>  // include all standard C++ libraries

using namespace std;

// Loops
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)

#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(xi, x) for (auto&& xi : x)
// Note: we can use rep(i,N) or rep(i,from,to)


// typedef
using ll = long long;
template <class T> using vec = vector<T>;
using vi   = vector<int>;
using vvi  = vector<vi>;
using vvvi = vector<vvi>;
using pii  = pair<int, int>;


// Constants

// Shorter repr for frequently used terms
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second


// Algorithms
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase( unique(all(v)), v.end() )
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))

template<class T> pair<T, size_t> max(vector<T> &x){ auto it = max_element(all(x)); return mp(*it, it-x.begin()); }
template<class T> pair<T, size_t> min(vector<T> &x){ auto it = min_element(all(x)); return mp(*it, it-x.begin()); }

template<class T> inline bool chmax(T &maxval, const T &newval) { if (maxval<newval) { maxval=newval; return 1; } return 0; }
template<class T> inline bool chmin(T &minval, const T &newval) { if (minval>newval) { minval=newval; return 1; } return 0; }

// Utilities
// Grid world utilities
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
#define inside(H,W,y,x) 0<=(x) && (x)<(W) && 0<=(y) && (y)<(H)

inline int in() {int x; cin >> x; return x;} // read int from cin
inline  ll IN() {ll x; cin >> x; return x;}  // read ll from cin



// Debug
#ifdef LOCAL
  #include "dump.hpp"
  #define debug(x) cerr << #x << ": " << x << '\n'
#else
  #define dump(...)
  #define debug(x)
#endif

// Paste snippets here!!

// 

int main(){
  cin.tie(0); ios::sync_with_stdio(false);    // Magic for faster cin
  int N, M; cin >> N >> M;
  vector<ll> A(N); vector<pair<ll,int>> CB(M);
  rep(i,N) cin >> A[i];
  rep(i,M){
    int B; ll C; 
    cin >> B >> C;
    CB[i] = mp(C,B);
  }
  sort(all(CB));

  unordered_map<ll, int> hist;
  rep(i,N) hist[A[i]]++;
  priority_queue<pair<ll,int>> que;
  for(auto kv : hist) {
    auto card = kv.first; auto freq = kv.second;
    que.push({-card, freq});
  }

  for(int i=M-1;i>=0;--i){
  //rep(i,M){
    int B = CB[i].second; ll C = CB[i].first;
    dump (B,C);
    int K = 0; // 何枚Cに変わるか
    bool finish = false;
    while(B>0){
      auto kv = que.top();
      auto negcard = kv.first; auto freq = kv.second;
      if(-negcard<C) {
        if(freq<=B){
          K += freq;
          //que.push({-C, freq});
          B-= freq;
        } else { // freq > B
          //cerr << B << " cards => " << C << " / " << freq-B << " cards => " << card << endl;
          //que.push({-C, B});
          K += B;
          que.push({negcard, freq-B});
          B = 0;
        }
        que.pop();
      } else { finish=true; break; }
    }
    que.push({-C,K});
  }
  ll sum = 0;
  while(!que.empty()){
    auto kv = que.top(); que.pop();
    auto negcard = kv.first; auto freq = kv.second;
    sum += -negcard * freq;
  }
  cout << sum << endl;
  return 0;
}


Measured memory_bytes: 11292