#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, C;
	cin >> N >> C;
	vector<int>P(N);
	rep(i, N) { cin >> P[i]; }
	sort(allR(P));
	vector<pair<pair<int, int>, bool>> Co(C);
	rep(i, C) {
		int t, x;
		cin >> t >> x;
		Co[i] = { {t,x},true };
	}
	int ans = 0;
	rep(i, N) {
		int minV = P[i];
		int use = -1;
		rep(j, C) {
			if (!Co[j].second) { continue; }
			int v;
			if (1 == Co[j].first.first) {
				v = max(0, P[i] - Co[j].first.second);
			}
			else {
				v = P[i] * (100 - Co[j].first.second) / 100;
			}
			if (minV > v) {
				minV = v;
				use = j;
			}
		}
		if (-1 != use) { Co[use].second = false; }
		ans += minV;
	}
	cout << ans << endl;
	return 0;
}