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