#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 10;
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 3) + (x << 1) + c - 48;
    c = getchar();
  }
  return x * f;
}
long long k, m, n;
long long a[maxn], sum[maxn], w[maxn], dp[maxn];
long long cmp(long long x, long long y) { return x > y; }
signed main() {
  n = read();
  m = read();
  k = read();
  for (register long long i = 1; i <= n; i++) a[i] = read();
  sort(a + 1, a + n + 1);
  for (register long long i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  for (register long long i = 1; i <= m; i++) {
    long long x = read(), y = read();
    w[x] = max(w[x], y);
  }
  memset(dp, 0x3f, sizeof(dp));
  dp[0] = 0;
  for (register long long i = 1; i <= k; i++) {
    for (register long long j = 0; j < i; j++) {
      long long num = i - j, min_ = w[num];
      dp[i] = min(dp[i], dp[j] + sum[i] - sum[j + min_]);
    }
  }
  printf("%lld\n", dp[k]);
  return 0;
}
