#include <bits/stdc++.h>
using namespace std;
int s[200009];
int best[200009];
int dp[2009];
int n, m, k, i, j;
struct tip {
  int val;
  int ind;
} v[200009];
bool compar(tip x, tip y) { return x.val < y.val; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (i = 1; i <= n; i++) cin >> v[i].val;
  for (i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    best[x] = max(best[x], y);
  }
  sort(v + 1, v + n + 1, compar);
  for (i = 1; i <= n; i++) s[i] = s[i - 1] + v[i].val;
  for (i = 1; i <= k; i++) dp[i] = s[i];
  for (i = 1; i <= k; i++)
    for (j = 1; j <= i; j++)
      dp[i] = min(dp[i - j] + s[i] - s[i - j + best[j]], dp[i]);
  cout << dp[k];
  return 0;
}
