#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], g[maxn], f[maxn], c[maxn];
int main() {
  memset(c, 0, sizeof(c));
  memset(g, 0, sizeof(g));
  memset(f, 0, sizeof(f));
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    if (x <= k) c[x] = max(c[x], y);
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) g[i] = g[i - 1] + a[i];
  for (int i = 1; i <= k; i++) {
    f[i] = 0;
    for (int j = 0; j < i; j++) {
      f[i] = max(f[i], f[j] + g[j + c[i - j]] - g[j]);
    }
  }
  cout << g[k] - f[k] << endl;
  return 0;
}
