#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define popcountll __builtin_popcountll #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll mypow(ll x, ll n, const ll &p = -1) { //x^nをmodで割った余り if (p != -1) { x =(x%p+p)%p; } ll ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; int dp[2][5001][5001]; void solve() { int n,c; cin>>n>>c; vectorp(n); rep(i,n)cin>>p[i]; sort(rall(p)); constexpr int inf=1e9; rep(i,2)rep(j,c+1)rep(k,c+1)dp[i][j][k]=inf; dp[0][0][0]=0; vectorone,two; rep(i,c){ int t,x; cin>>t>>x; if(t==1)one.eb(x); else two.eb(x); } sort(rall(one)); sort(rall(two)); int sz=one.size(),sz2=two.size(); int ans=inf; rep(i,n){ for(int j=0;j<=min(sz,i);++j){ if(dp[i%2][j][i-j]==inf)continue; if(j+1<=min(sz,i+1)){ chmin(dp[(i+1)%2][j+1][i-j],dp[i%2][j][i-j]+max(0,p[i]-one[j])); if(i+1==n){ chmin(ans,dp[n%2][j+1][i-j]); } } if(i-j+1<=min(sz2,i+1)){ chmin(dp[(i+1)%2][j][i-j+1],dp[i%2][j][i-j]+p[i]*(100-two[i-j])/100); if(i+1==n){ chmin(ans,dp[n%2][j][i-j+1]); } } chmin(dp[(i+1)%2][j][i-j],dp[i%2][j][i-j]+p[i]); if(i+1==n){ chmin(ans,dp[n%2][j][i-j]); } dp[i%2][j][i-j]=inf; } } cout<