#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define int long long

int pref[100001], pref2[100001];
vector<int> c(100000);
vector<pair<int, int> > shops(100000);
vector<int> farms(100000);
int shop_ind;
int mon;


bool comp(pair<int, int> p, pair<int, int> q) {
    return p.second > q.second;
}

int rent(int i) {
    return pref[i];
}

void setIO(string s) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

int produce(int cow) {
    if(cow == 0) return 0;
    int prefsum = c[cow - 1];
    //for (int cow = 0; cow < 100000; cow++) {
    while (shops[shop_ind].first > 0) {
        int sell = min(prefsum, shops[shop_ind].first);
        prefsum -= sell;
        shops[shop_ind].first -= sell;
        mon += sell * shops[shop_ind].second;
        if (shops[shop_ind].first == 0) {
            shop_ind++;
        }
        if (prefsum == 0) {
            break;
        }
    }
    //}
    return mon;
}
signed main() {
    setIO("rental");
    int N, M, R;
    cin >> N >> M >> R; //cows, stores, neighbors
    for (int i = 0; i < N; i++) {
        cin >> c[i];
    }
    sort(c.rbegin(), c.rend());
    for(int i = 1; i <= N; ++i) {
        pref2[i] = pref2[i - 1] + c[i - 1];
    }
    for (int i = 0; i < M; i++) {
        cin >> shops[i].first >> shops[i].second;
    }
    sort(shops.begin(), shops.end(), comp);
    for (int i = 0; i < R; i++) {
        cin >> farms[i];
    }
    sort(farms.rbegin(), farms.rend());
    for(int i = 1; i <= R; ++i) {
        pref[i] = pref[i - 1] + farms[i - 1];
    }
    shop_ind = 0;
    mon = 0;
    int ans = 0;
    for (int i = 0; i <= N; i++) {
        int x = produce(i);
        ans = max(x + rent(min(R, N - i)), ans);
    }
    cout << ans << endl;
}