#include <bits/stdc++.h>
using namespace std;
long long a[200020];
long long b[200020];
long long dp[200020];
long long sum[200020];
int main() {
  long long t;
  long long n, m, k;
  cin >> n >> m >> k;
  for (long long i = 0; i <= k; i++) {
    b[i] = -1;
  }
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  sum[0] = 0;
  for (long long i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  long long x, y;
  for (long long j = 0; j < m; j++) {
    cin >> x >> y;
    if (x > k) {
      continue;
    }
    b[x] = max(b[x], y);
  }
  dp[0] = 0;
  for (long long i = 1; i <= k; i++) {
    dp[i] = sum[i];
    for (long long j = 1; j <= i; j++) {
      if (b[j] == -1) {
        continue;
      }
      if (i - j + b[j] < 0) {
        continue;
      }
      if (i == 3) {
      }
      dp[i] = min(dp[i], dp[i - j] + sum[i] - sum[i - j + b[j]]);
    }
  }
  cout << dp[k] << endl;
  return 0;
}
