#include <bits/stdc++.h>
using namespace std;
int N, M, K, v[200005], s[200005], x[200005], X, Y, d[200005];
int main() {
  cin >> N >> M >> K;
  for (int i = 1; i <= N; i++) cin >> v[i];
  sort(v + 1, v + 1 + N);
  for (int i = 1; i <= K; i++) {
    s[i] = s[i - 1] + v[i];
    d[i] = 2140000000;
  }
  for (int i = 1; i <= M; i++) {
    cin >> X >> Y;
    x[X] = max(x[X], Y);
  }
  for (int i = 1; i <= K; i++)
    for (int j = 1; j <= i; j++)
      d[i] = min(d[i], d[i - j] + s[i] - s[i - j + x[j]]);
  cout << d[K];
  return 0;
}
