#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int dp[5050][5050];
int main()
{
    int n, c; cin>>n>>c;
    int p[5050];
    for(int i=0; i<n; i++){
        cin>>p[i];
    }
    vector<int> v1, v2;
    for(int i=0; i<c; i++){
        int t, x; cin>>t>>x;
        if(t==1) v1.push_back(x);
        else v2.push_back(x);
    }
    sort(v1.begin(), v1.end(), greater<int>());
    sort(v2.begin(), v2.end(), greater<int>());
    const int INF=1e9+7;
    for(int i=0; i<=n; i++){
        for(int j=0; j<=v1.size(); j++){
            dp[i][j]=INF;
        }
    }
    dp[0][0]=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<=v1.size() && j<=i; j++){
            int p1=p[i];
            if(i-j<v2.size()) p1=p[i]*(100-v2[i-j])/100;
            dp[i+1][j]=min(dp[i+1][j], dp[i][j]+p1);
            int p2=p[i];
            if(j<v1.size()) p2=max(p[i]-v1[j], 0);
            dp[i+1][j+1]=min(dp[i+1][j+1], dp[i][j]+p2);
        }
    }
    int ans=INF;
    for(int i=0; i<=v1.size(); i++) ans=min(ans, dp[n][i]);
    cout<<ans<<endl;
    return 0;
}