#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int MAX = 2e5 + 5;
const long long MAX2 = 11;
const long long MOD = 1000000007;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
int n, x[MAX], z[MAX], k, m, a, b, ans, dp[2005];
pair<int, int> y[MAX];
int f(int nw) {
  if (!nw) return 0;
  if (dp[nw] != -1) return dp[nw];
  int ret = x[nw];
  for (long long i = 1; i <= nw; ++i)
    ret = min(ret, f(nw - i) + x[nw] - x[nw - i + z[i]]);
  return dp[nw] = ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; ++i) cin >> x[i];
  sort(x + 1, x + 1 + n);
  for (long long i = 1; i <= n; ++i) x[i] += x[i - 1];
  for (long long i = 1; i <= k; ++i) y[i] = {i, i};
  while (m--) {
    cin >> a >> b;
    z[a] = max(z[a], b);
  }
  memset(dp, -1, sizeof dp);
  cout << f(k) << "\n";
  return 0;
}
