#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxn = 2e5 + 5;
int a[mxn], offer[mxn][2];
ll sum[2005], dp[2005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  auto mini = [&](ll &a, ll b) {
    if (b < a) a = b;
  };
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < m; ++i) cin >> offer[i][0] >> offer[i][1];
  sum[0] = 0;
  for (int i = 0; i < k; ++i) sum[i + 1] = sum[i] + a[i];
  for (int i = 0; i < k; ++i) dp[i] = sum[k];
  dp[k] = 0;
  for (int i = k; i; --i) {
    mini(dp[i - 1], dp[i] + a[i - 1]);
    for (int j = 0; j < m; ++j)
      if (i >= offer[j][0])
        mini(dp[i - offer[j][0]],
             dp[i] + sum[i] - sum[i - offer[j][0] + offer[j][1]]);
  }
  cout << dp[0] << endl;
}
