#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long N, M, K;
  cin >> N >> M >> K;
  vector<long> A(N + 1, 0);
  for (long i = 1; i <= N; ++i) cin >> A[i];
  vector<pair<long, long> > O(M);
  for (long i = 0; i < M; ++i) cin >> O[i].first >> O[i].second;
  sort(A.begin() + 1, A.end());
  for (long i = 1; i <= N; ++i) A[i] += A[i - 1];
  vector<long> L(K + 2, 0);
  for (long i = K; i > 0; --i) {
    L[i] = L[i + 1];
    for (long j = 0; j < M; ++j) {
      if (O[j].first > K - i + 1) continue;
      L[i] = max(L[i], L[i + O[j].first] + A[i + O[j].second - 1] - A[i - 1]);
    }
  }
  cout << A[K] - L[1];
  return 0;
}
