#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 100;
int n, m, k;
long long x, y;
long long a[211111], b[maxn];
long long dp[maxn], s[211111];
int main() {
  ios::sync_with_stdio(0);
  cin.tie();
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= k; ++i) s[i] = s[i - 1] + a[i];
  for (int i = 1; i <= m; ++i) {
    cin >> x >> y;
    if (x <= k) b[x] = max(b[x], y);
  }
  for (int i = 1; i <= k; ++i) {
    dp[i] = dp[i - 1] + a[i];
    for (int j = 0; j < i; ++j) {
      dp[i] = min(dp[i], dp[j] + s[i] - s[j + b[i - j]]);
    }
  }
  cout << dp[k] << endl;
  return 0;
}
