#include <bits/stdc++.h>
using namespace std;
const long long maxm = 2e6 + 5;
long long sum[maxm];
long long ma[maxm];
long long d[maxm];
long long a[maxm];
long long n, m, k;
void solve() {
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  for (long long i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  for (long long i = 1; i <= m; i++) {
    long long x, y;
    cin >> x >> y;
    ma[x] = max(ma[x], y);
  }
  for (long long i = 1; i <= k; i++) {
    d[i] = d[i - 1] + a[i];
    for (long long j = 0; j <= i - 1; j++) {
      long long dif = i - j;
      if (ma[dif]) {
        d[i] = min(d[i], sum[i] - sum[j + ma[dif]] + d[j]);
      }
    }
  }
  cout << d[k] << endl;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
