#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) {
  if ((a.first - a.second) != (b.first - b.second))
    return ((a.first - a.second) < (b.first - b.second));
  return (a.second > b.second);
}
int n, m, k;
long long dp[2005];
long long a[200005];
int hsh[2005];
int main() {
  int i, u, ve, j;
  scanf("%d", &n);
  scanf("%d", &m);
  scanf("%d", &k);
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (i = 0; i < m; i++) {
    scanf("%d", &u);
    scanf("%d", &ve);
    if (u > k) continue;
    hsh[u] = max(hsh[u], ve);
  }
  sort(a + 1, a + n + 1);
  for (i = 2; i <= k; i++) a[i] += a[i - 1];
  dp[0] = 0;
  for (i = 1; i <= k; i++) {
    dp[i] = a[i];
    for (j = 1; j <= i; j++)
      dp[i] = min(dp[i], dp[i - j] + a[i] - a[i - j + hsh[j]]);
  }
  printf("%lld\n", dp[k]);
  return 0;
}
