#include <bits/stdc++.h>
using namespace std;
long long maxcnt[2004];
long long a[200005];
long long dp[2005];
long long ps[2005];
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  for (long long i = 1; i < n + 1; ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (long long i = 1; i < k + 1; ++i) {
    ps[i] = ps[i - 1] + a[i];
  }
  for (long long i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    if (x <= k) maxcnt[x] = max(maxcnt[x], y);
  }
  for (long long i = 1; i < k + 1; ++i) dp[i] = 1e15;
  for (long long i = 1; i < k + 1; ++i) {
    for (long long j = 0; j < i; ++j) {
      dp[i] = min(dp[i], dp[j] + ps[i] - ps[j + maxcnt[i - j]]);
    }
  }
  cout << dp[k] << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
