#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, m, k;
int a[N], b[N];
long long dp[N], sum[N];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int i, j;
  cin >> n >> m >> k;
  for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) {
    cin >> a[i];
  }
  while (m--) {
    int x, y;
    cin >> x >> y;
    b[x] = max(b[x], y);
  }
  sort(a + 1, a + n + 1);
  for (i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1; 1 < n + 1 ? i += 1 : i -= 1) {
    sum[i] = sum[i - 1] + a[i];
    dp[i] = sum[i];
  }
  for (i = 1; 1 < k + 1 ? i < k + 1 : i > k + 1; 1 < k + 1 ? i += 1 : i -= 1) {
    for (j = 1; 1 < i + 1 ? j < i + 1 : j > i + 1;
         1 < i + 1 ? j += 1 : j -= 1) {
      dp[i] = min(dp[i], dp[i - j] + sum[i] - sum[i + b[j] - j]);
    }
  }
  cout << dp[k] << endl;
  return 0;
}
