#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
inline int read() {
  int x = 0, flag = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') flag = 0;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + c - 48;
    c = getchar();
  }
  return flag ? x : -x;
}
int n, m, K, a[N], ans = 0, c[N], dp[N];
int main() {
  n = read(), m = read(), K = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= K; i++) a[i] += a[i - 1];
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    c[x] = max(c[x], y);
  }
  memset(dp, 63, sizeof(dp));
  dp[0] = 0;
  for (int i = 1; i <= K; i++)
    for (int j = 0; j < i; j++)
      dp[i] = min(dp[i], dp[j] + a[i] - a[j + c[i - j]]);
  printf("%d", dp[K]);
}
