#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr static int mod = 1e9 + 7;
constexpr static int inf = (1 << 30) - 1;
constexpr static Int infll = (1LL << 61) - 1;
int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0);
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

int main()
{
	int N, C;
	cin >> N >> C;
	vector<Int> P(N);
	for (int i = 0; i < N; i++)
	{
		cin >> P[i];
	}

	vector<Int> T1(max(N + 1, C + 1)), T2(max(N + 1, C + 1));
	int c1 = 0, c2 = 0;
	for (int i = 0; i < C; i++)
	{
		Int t, X;
		cin >> t >> X;
		if (t == 1)
		{
			T1[c1] = X;
			c1++;
		}
		else
		{
			T2[c2] = X;
			c2++;
		}
	}

	sort(T1.rbegin(), T1.rbegin() + c1);
	sort(T2.rbegin(), T2.rbegin() + c2);
	sort(P.rbegin(), P.rend());

	vector<vector<Int>> dp(N + 1, vector<Int>(N + 1, infll));
	for (int i = 0; i <= N; i++)
	{
		dp[N][i] = 0;
	}

	for (int i = N - 1; i >= 0; i--)
	{
		for (int j = 0; j <= i; j++)
		{
			Int p1 = max(0LL, P[i] - T1[j]) + dp[i + 1][j + 1];
			Int p2 = P[i] * (100 - T2[i - j]) / 100 + dp[i + 1][j];
			dp[i][j] = min(p1, p2);
		}
	}

	cout << dp[0][0] << endl;
}