#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long a[N];
long long mp[2005];
struct node {
  int x, y;
} b[N];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) a[i] += a[i - 1];
  for (int i = 1; i <= m; i++) cin >> b[i].x >> b[i].y;
  for (int i = 1; i <= k; i++) {
    long long ans = mp[i - 1] + a[i] - a[i - 1];
    for (int j = 1; j <= m; j++) {
      if (b[j].x <= i) {
        ans = min(ans, mp[i - b[j].x] + a[i] - a[i - (b[j].x - b[j].y)]);
      }
    }
    mp[i] = ans;
  }
  cout << mp[k] << endl;
  return 0;
}
