#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
const int N = 2005, K = 200005, MOD = 1e9 + 7;
int n, m, k, dp[N], a[K], p[N], cst[N], sm[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1, x, y; i <= m; ++i) {
    cin >> x >> y;
    if (x <= k) p[x] = max(p[x], y);
  }
  fill(dp + 1, dp + N, (int)2e9);
  for (int i = 0; i < k; ++i) {
    if (dp[i] == (int)2e9) continue;
    fill(cst, cst + N, (int)2e9);
    for (int j = i + 1; j <= k; ++j) {
      sm[j - i] = sm[j - i - 1] + a[j];
      cst[j - i] = min(cst[j - i], sm[j - i]);
    }
    for (int j = 1; j <= k; ++j) {
      if (p[j] <= k - i) {
        cst[j] = min(cst[j], sm[j] - sm[p[j]]);
      }
    }
    for (int j = 1; j <= k - i; ++j) {
      dp[i + j] = min(dp[i + j], dp[i] + cst[j]);
    }
  }
  cout << dp[k] << '\n';
  return 0;
}
