#include <bits/stdc++.h>
using namespace std;
int v[2 * 100003];
int offer[2003];
int dp[2003];
int part[2003];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  bool special = false;
  for (int i = 1; i <= n; i++) {
    cin >> v[i];
  }
  dp[1] = v[1];
  dp[0] = 0;
  sort(v + 1, v + n + 1);
  n = k;
  int x, y;
  for (int i = 1; i <= n; i++) {
    part[i] = part[i - 1] + v[i];
    dp[i] = part[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    if (x > k) continue;
    if (x == 1) {
      cout << 0;
      return 0;
    }
    offer[x] = max(offer[x], y);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = i - 1; j >= 1; j--) {
      int bestOffer = i - j + 1 - offer[i - j + 1];
      dp[i] = min(dp[i], part[i] - part[i - bestOffer] + dp[j - 1]);
    }
  }
  cout << dp[n] << '\n';
  return 0;
}
