#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int sum[2010] = {}, dp[2010] = {}, a[2010] = {};
int main() {
  int i, j, n, m, k;
  cin >> n >> m >> k;
  for (i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  for (j = 0; j < m; j++) {
    int x, y;
    cin >> x >> y;
    if (x > 2000) continue;
    a[x] = max(a[x], y);
  }
  sort(v.begin(), v.end());
  for (i = 1; i <= k; i++) {
    sum[i] += sum[i - 1] + v[i - 1];
    dp[i] = sum[i];
  }
  for (i = 1; i <= k; i++) {
    for (j = 1; j <= i; j++) {
      dp[i] = min(dp[i], dp[i - j] + sum[i] - sum[i + a[j] - j]);
    }
  }
  cout << dp[k] << endl;
}
