#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int dp[N];
int n, m, k;
int a[N], sum[N];
vector<pair<int, int> > p;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  n = min(n, k);
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    p.push_back(make_pair(x, y));
  }
  for (int i = 1; i <= n; i++) {
    dp[i] = dp[i - 1] + a[i];
    for (auto v : p) {
      if (i >= v.first)
        dp[i] =
            min(dp[i], dp[i - v.first] + sum[i] - sum[i - v.first + v.second]);
    }
  }
  cout << dp[n];
  return 0;
}
