#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

void chmin(int &a, int b) { a = min(a, b); }

int INF = 1e+9;
int n, C;
int p[5000];
vector<int> hiki;
vector<int> wari;
int dp[5001][5001];

signed main() {
	int i, j;
	
	cin >> n >> C;
	rep(i, n) cin >> p[i];
	sort(p, p + n, greater<int>());
	
	rep(i, C) {
		int t, x; cin >> t >> x;
		if (t == 1) { hiki.push_back(x); }
		else { wari.push_back(x); }
	}
	sort(hiki.begin(), hiki.end(), greater<int>());
	sort(wari.begin(), wari.end(), greater<int>());
	
	rep(i, hiki.size() + 1) rep(j, wari.size() + 1) dp[i][j] = INF;
	dp[0][0] = 0;
	
	rep(i, hiki.size() + 1) {
		rep(j, wari.size() + 1) {
			if (i + j >= n) continue;
			if (i < hiki.size()) {
				chmin(dp[i + 1][j], dp[i][j] + max(p[i + j] - hiki[i], 0));
			}
			if (j < wari.size()) {
				chmin(dp[i][j + 1], dp[i][j] + p[i + j] * (100 - wari[j]) / 100);
			}
		}
	}
	
	if (C >= n) {
		int ans = INF;
		rep(i, hiki.size() + 1) {
			int j = n - i;
			if (j > wari.size()) continue;
			chmin(ans, dp[i][j]);
		}
		cout << ans << endl;
	}
	else {
		int ans = INF;
		rep(i, hiki.size() + 1) {
			int j = C - i;
			if (j > wari.size()) continue;
			chmin(ans, dp[i][j]);
		}
		
		for (i = C; i < n; i++) {
			ans += p[i];
		}
		cout << ans << endl;
	}
	return 0;
}