#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long dp[2005];
long long opt[2005];
vector<long long> a, s, x, y;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  a.resize(n);
  s.resize(n + 1);
  for (long long i = 0; i < n; ++i) cin >> a[i];
  sort(a.begin(), a.end());
  s[0] = 0;
  for (long long i = 0; i < n; ++i) s[i + 1] = s[i] + a[i];
  x.resize(m);
  y.resize(m);
  for (long long i = 0; i < m; ++i) cin >> x[i] >> y[i];
  for (long long i = 0; i < m; ++i) {
    if (x[i] <= k) opt[x[i]] = max(opt[x[i]], y[i]);
  }
  for (long long i = 1; i <= k; ++i) {
    dp[i] = dp[i - 1] + a[i - 1];
    for (long long j = 1; i - j >= 0; ++j) {
      long long sum = s[i] - s[i - j + opt[j]];
      dp[i] = min(dp[i], dp[i - j] + sum);
    }
  }
  cout << dp[k] << endl;
  return 0;
}
