#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,C;
int P[5050];
int A,B;
int X[5050],Y[5050];

ll from[5050],to[5050];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>C;
	FOR(i,N) cin>>P[i];
	FOR(i,C) {
		cin>>x>>y;
		if(x==1) X[A++]=y;
		else Y[B++]=y;
	}
	sort(P,P+N);
	reverse(P,P+N);
	sort(X,X+5000);
	reverse(X,X+5000);
	sort(Y,Y+5000);
	reverse(Y,Y+5000);
	
	FOR(i,5050) from[i]=1LL<<60;
	from[0]=0;
	FOR(i,N) {
		FOR(j,5050) to[j]=1LL<<60;
		
		FOR(j,i+1) {
			to[j+1]=min(to[j+1],from[j]+P[i]-min(P[i],X[j]));
			to[j]=min(to[j],from[j]+P[i]*(100-Y[i-j])/100);
		}
		
		swap(from,to);
	}
	
	cout<<*min_element(from,from+N+1)<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}