#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 500;
int v[maxn], psum[2005], dp[2005];
vector<pair<int, int> > v2;
signed main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  v2.push_back({0, 0});
  for (int i = 1; i <= n; ++i) cin >> v[i];
  for (int i = 1; i <= m; ++i) {
    int a, b;
    cin >> a >> b;
    if (a <= k) v2.push_back({a, b});
  }
  sort(v, v + n + 1);
  reverse(v + 1, v + k + 1);
  for (int i = 1; i <= k; ++i) dp[i] = psum[i] = psum[i - 1] + v[i];
  for (int j = 1; j <= k; ++j) {
    for (int i = 1; i < (int)(v2).size(); ++i) {
      if (j >= v2[i].first)
        dp[j] = min({dp[j - v2[i].first] + psum[j - v2[i].second] -
                         psum[j - v2[i].first],
                     dp[j], dp[j - 1] + v[j]});
      else
        dp[j] = min(dp[j], dp[j - 1] + v[j]);
    }
  }
  cout << dp[k] << '\n';
}
