#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const long long mo = 1e9 + 7;
const long long inf = 1e9;
const long long Inf = 1e18;
long long w[N], a[N];
int x[N], y[N];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &k, &m);
  for (int i = (1); i <= (n); ++i) scanf("%lld", &w[i]);
  sort(w + 1, w + n + 1);
  for (int i = (1); i <= (m); ++i) w[i] += w[i - 1], a[i] = w[i];
  for (int i = (1); i <= (k); ++i) scanf("%d%d", &x[i], &y[i]);
  for (int i = (1); i <= (m); ++i)
    for (int j = (1); j <= (k); ++j)
      if (x[j] <= i) a[i] = min(a[i - x[j]] + w[i] - w[i - x[j] + y[j]], a[i]);
  printf("%lld\n", a[m]);
}
