#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5, MAXK = 2e3;
;
int n, m, k, a[MAXN], y[MAXK + 1];
long long b[MAXN + 1], dp[MAXK + 1];
long long cost(int i, int j) {
  return b[j + 1] - b[i] - (b[i + y[j + 1 - i]] - b[i]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (int i = 0; i < n; ++i) b[i + 1] = b[i] + a[i];
  for (int i = 0; i < m; ++i) {
    int xi, yi;
    cin >> xi >> yi;
    if (xi > k) continue;
    y[xi] = max(yi, y[xi]);
  }
  for (int i = 1; i <= k; ++i) {
    dp[i] = 1e18;
    for (int j = 1; j <= i; ++j) {
      dp[i] = min(dp[i - j] + cost(i - j, i - 1), dp[i]);
    }
  }
  cout << dp[k];
  return 0;
}
