#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll>;
using vi3 = vector<i3>;
using vlii = vector<lii>;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9, PI = acos(-1);
int n, m, k;
ll a[N];
int offer[N];
ll mem[2005];
ll dp(int i) {
  if (i == k + 1) return 0ll;
  if (i > k) return INF;
  ll &ret = mem[i];
  if (ret != -1) return ret;
  ret = a[i] - a[i - 1] + dp(i + 1);
  for (int x = 1; i + x - 1 <= k; x++) {
    if (offer[x] > 0) {
      int y = offer[x];
      ret = min(ret, a[i + x - 1] - a[i + y - 1] + dp(i + x));
    }
  }
  return ret;
}
void solve(int testCase) {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    offer[x] = max(offer[x], y);
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= k; i++) a[i] += a[i - 1];
  memset(mem, -1, sizeof mem);
  printf("%lld\n", dp(1));
}
int main() {
  int t = 1;
  for (int testCase = 1; testCase <= t; testCase++) {
    solve(testCase);
  }
  return 0;
}
