#include <bits/stdc++.h>
using namespace std;
long long n, m, k, x, y, i, j, f[2000001], a[2000001], sum[2000001], b[2000001];
int main() {
  scanf("%lld%lld%lld", &n, &m, &k);
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (i = 1; i <= m; i++) {
    scanf("%lld%lld", &x, &y);
    if (x <= k) {
      b[x] = max(b[x], y);
    }
  }
  sort(a + 1, a + n + 1);
  n = k;
  for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  for (i = 1; i <= n; i++) f[i] = 1e15;
  f[0] = 0;
  for (i = 1; i <= n; i++)
    for (j = 0; j < i; j++) f[i] = min(f[i], f[j] + sum[i] - sum[j + b[i - j]]);
  printf("%lld", f[n]);
}
