#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int N, M, K;
  cin >> N >> M >> K;
  vector<int> v(N);
  map<int, int> offer;
  for (auto &i : v) cin >> i;
  int a, b;
  for (int i = 0; i < M; i++) {
    cin >> a >> b;
    if (a > K) continue;
    offer[a] = max(offer[a], b);
  }
  sort(v.begin(), v.end());
  v = vector<int>(v.begin(), v.begin() + K);
  reverse(v.begin(), v.end());
  vector<int> memo(K + 1, 1e9);
  memo[0] = 0;
  for (int i = 0; i < K; i++) {
    for (auto x : offer) {
      int tmp = 0;
      if (i + x.first > K) break;
      for (int j = 0; j < x.first - x.second; j++) tmp += v[i + j];
      memo[i + x.first] = min(memo[i] + tmp, memo[i + x.first]);
    }
    memo[i + 1] = min(memo[i + 1], memo[i] + v[i]);
  }
  cout << memo[K];
  return 0;
}
