#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int dp[maxn], sum[maxn];
int a[maxn];
pair<int, int> p[maxn];
int n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= k; i++) {
    sum[i] = sum[i - 1] + a[i];
    dp[i] = dp[i - 1] + a[i];
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &p[i].first, &p[i].second);
  }
  sort(p + 1, p + m + 1);
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= m; j++) {
      int v = i - p[j].first;
      if (v < 0) break;
      int w = v + p[j].second >= i ? i : v + p[j].second;
      dp[i] = min(dp[i], dp[v] + sum[i] - sum[w]);
    }
  }
  printf("%d\n", dp[k]);
  return 0;
}
