#include <bits/stdc++.h>
using namespace std;
int a[200010];
int c[200010];
long long dp[2200];
long long sum[200010];
int main(void) {
  int n, m, k, i, j;
  while (scanf("%d%d%d", &n, &m, &k) == 3) {
    for (i = 1; i <= n; i++) scanf("%d", &a[i]);
    memset(c, 0, sizeof(c));
    for (i = 1; i <= m; i++) {
      int x, y;
      scanf("%d%d", &x, &y);
      c[x] = max(c[x], y);
    }
    sort(a + 1, a + n + 1);
    sum[0] = 0;
    for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
    for (i = 1; i <= k; i++) dp[i] = 1e16;
    for (i = 1; i <= k; i++) {
      for (j = 0; j < i; j++) {
        dp[i] = min(dp[i], dp[j] + sum[i] - sum[j + c[i - j]]);
      }
    }
    printf("%lld\n", dp[k]);
  }
  return 0;
}
