#include <bits/stdc++.h>
const int maxn = 2e5 + 5;
using namespace std;
int n, m, cost[maxn], d[maxn], g[maxn], x, y, k;
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> cost[i];
  sort(cost + 1, cost + 1 + n);
  for (int i = 1; i <= n; i++) cost[i] += cost[i - 1];
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    g[x] = max(g[x], y);
  }
  for (int i = 1; i <= k; i++) {
    d[i] = INT_MAX;
    for (int j = 0; j < i; j++)
      d[i] = min(d[i], d[j] + cost[i] - cost[j + g[i - j]]);
  }
  cout << d[k];
  return 0;
}
