#include <bits/stdc++.h>
using namespace std;

int dp[5005][5005];
 
int main() {
    int N,C;
    cin >> N >> C;
    vector<int>P(N);
    for(int i = 0; i < N; i++) {
        cin >> P[i];
    }
    vector<int>X,Y;
    for(int i = 0; i < C; i++) {
        int T,C;
        cin >> T >> C;
        if(T == 2) {
            X.push_back(C);
        }
        else {
            Y.push_back(C);
        }
    }
    sort(X.rbegin(),X.rend());
    sort(Y.rbegin(),Y.rend());
    sort(P.rbegin(),P.rend());
    for(int i = 0; i <= N; i++) {
        for(int j = 0; j <= C; j++) {
            dp[i][j] = 1e9;
        }
    }
    dp[0][0] = 0;
    for(int i = 0; i < N; i++) {
        for(int j = 0; j <= X.size(); j++) {
            if(dp[i][j] == 1e9) {
                continue;
            }
            if(j < X.size()) {
                dp[i+1][j+1] = min(dp[i+1][j+1],dp[i][j]+P[i]/100*(100-X[j]));
            }
            if(i >= j && i-j < Y.size()) {
                dp[i+1][j] = min(dp[i+1][j],dp[i][j]+max(0,P[i]-Y[i-j]));
            }
            dp[i+1][j] = min(dp[i+1][j],dp[i][j]+P[i]);
        }
    }
    int ans = 1e9;
    for(int i = 0; i <= X.size(); i++) {
        ans = min(ans,dp[N][i]);
    }
    cout << ans << endl;
}