#include <bits/stdc++.h>
using namespace std;
const double INF = 1e9;
const int MOD = 1e9 + 7;
const int N = 2 * 1e5 + 5;
const int K = 2005;
int n, m, k, a[N], dp[K], acc[K], getFor[K];
int main() {
  ios_base::sync_with_stdio(false);
  memset(getFor, -1, sizeof(getFor));
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) cin >> a[i + 1];
  sort(a, a + n + 1);
  acc[1] = a[1];
  for (int i = 2; i <= k; i++) acc[i] = acc[i - 1] + a[i];
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    if (x < K) {
      getFor[x] = max(getFor[x], y);
    }
  }
  for (int i = 0; i < K; i++) dp[i] = INF;
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    for (int bought = 1; bought <= i; bought++) {
      if (getFor[bought] != -1) {
        dp[i] = min(dp[i],
                    acc[i] - acc[i - bought + getFor[bought]] + dp[i - bought]);
      }
    }
    dp[i] = min(dp[i], a[i] + dp[i - 1]);
  }
  cout << dp[k] << endl;
  return 0;
}
